Recht, Peter; Stehling, Stefan On maximum cycle packings in polyhedral graphs. (English) Zbl 1306.05195 Electron. J. Graph Theory Appl. 2, No. 1, 18-31 (2014). 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. Cited in 1 Document 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 Keywords:maximum cycle packing; polyhedral graphs; vertex-disjoint cycles; edge-disjoint cycle PDFBibTeX XMLCite \textit{P. Recht} and \textit{S. Stehling}, Electron. J. Graph Theory Appl. 2, No. 1, 18--31 (2014; Zbl 1306.05195) Full Text: DOI