On maximum cycle packings in polyhedral graphs

DOI10.5614/ejgta.2014.2.1.2zbMath1306.05195OpenAlexW2001734424MaRDI QIDQ5177031

Stefan Stehling, Peter Recht

Publication date: 5 March 2015

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2014.2.1.2

zbMATH Keywords

vertex-disjoint cyclesmaximum cycle packingpolyhedral graphsedge-disjoint cycle

Mathematics Subject Classification ID

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

Related Items (1)

Maximum cycle packing using SPR-trees

This page was built for publication: On maximum cycle packings in polyhedral graphs