No CrossRef data available.
Article contents
Cycle Partitions in Graphs
Published online by Cambridge University Press: 12 September 2008
Abstract
In this paper, we prove that every graph contains a cycle intersecting all maximum independent sets. Using this, we further prove that every graph with stability number α is spanned by α disjoint cycles. Here, the empty set, the graph of order 1 and the path of order 2 are all considered as degenerate cycles.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1996