×

On maximum cycle packings in polyhedral graphs. (English) Zbl 1306.05195

Summary: This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint cycle packing in a polyhedral graph \(G\). Bounds on the cardinality of such packings are provided, that depend on the size, the order or the number of faces of \(G\), respectively. Polyhedral graphs are constructed, that attain these bounds.

MSC:

05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C10 Planar graphs; geometric and topological aspects of graph theory
05C38 Paths and cycles
PDFBibTeX XMLCite
Full Text: DOI