Title of article
Packing cycles in graphs, II
Author/Authors
Ding، نويسنده , , Guoli and Xu، نويسنده , , Zhenzhen and Zang، نويسنده , , Wenan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
10
From page
244
To page
253
Abstract
A graph G packs if for every induced subgraph H of G, the maximum number of vertex-disjoint cycles in H is equal to the minimum number of vertices whose deletion from H results in a forest. The purpose of this paper is to characterize all graphs that pack.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2003
Journal title
Journal of Combinatorial Theory Series B
Record number
1527163
Link To Document