Title

Packing cycles in graphs, II

Document Type

Article

Publication Date

1-1-2003

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. © 2002 Elsevier Science (USA). All rights reserved.

Publication Source (Journal or Book title)

Journal of Combinatorial Theory. Series B

First Page

244

Last Page

253

This document is currently not available here.

Share

COinS