CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
On pseudo 2-factors
Authors
Siham Bekkai
Mekkia Kouider
Publication date
28 February 2009
Publisher
Elsevier B.V.
Doi
Cite
Abstract
AbstractWe show that a graph with minimum degree δ, independence number α≥δ and without isolated vertices, possesses a partition by vertex-disjoint cycles and at most α−δ+1 edges or vertices
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Elsevier - Publisher Connector
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 28/04/2017