A note on a cycle partition problem
โ
Fengli Yang; Elkin Vumar
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 209 KB
Let G be any graph, and let c(G) denote the circumference of G. If, for every pair c 1 , c 2 of positive integers satisfying c 1 + c 2 = c(G), the vertex set of G admits a partition into two sets V 1 and V 2 such that V i induces a graph of circumference at most c i , i = 1, 2, then G is said to be