Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0095-8956(02)00007-2 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
h result,graph g,vertex-disjoint cycle,minimum number,induced subgraph h,maximum number | Discrete mathematics,Indifference graph,Combinatorics,Induced path,Chordal graph,Clique-sum,Induced subgraph,Cograph,Universal graph,Pancyclic graph,Mathematics | Journal |
Volume | Issue | ISSN |
87 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
6 | 0.58 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guoli Ding | 1 | 444 | 51.58 |
| Zhenzhen Xu | 2 | 80 | 11.66 |
| Wenan Zang | 3 | 305 | 39.19 |