Please use this identifier to cite or link to this item:
|Title:||Cycle partitions in graphs|
|Authors:||Chen, C.C. |
|Source:||Chen, C.C.,Jin, G.P. (1996). Cycle partitions in graphs. Combinatorics Probability and Computing 5 (2) : 95-97. ScholarBank@NUS Repository.|
|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 a disjoint cycles. Here, the empty set, the graph of order 1 and the path of order 2 are all considered as degenerate cycles. Copyright © 1996 Cambridge University Press.|
|Source Title:||Combinatorics Probability and Computing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 17, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.