On maximum cycle packings in polyhedral graphs

DOI10.5614/EJGTA.2014.2.1.2MaRDI QIDQ5177031zbMATH OpenOpenAlexFDO

Authors Stefan Stehling, Peter Recht

Publication date 5 March 2015

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

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

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

zbMATH Keywords

edge-disjoint cyclemaximum cycle packingpolyhedral graphsvertex-disjoint cycles

Mathematics Subject Classification ID

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

Recommendations

• Cycle packings in graphs and digraphs
• Maximum packings of the complete graph with uniform length cycles
• scientific article; zbMATH DE number 637534
• Cycle packings of the complete multigraph
• Packing cycles in graphs
• On packing shortest cycles in graphs
• Packing cycles in complete graphs
• Maximum cyclic 4-cycle packings of the complete multipartite graph
• Packing cycles in graphs. II
• Maximum packings with odd cycles

Cited in

(6)

• A general construction for optimal cyclic packing designs
• Maximum cycle packing in Eulerian graphs using local traces
• scientific article; zbMATH DE number 3882483 (Why is no real title available?)
• scientific article; zbMATH DE number 637534 (Why is no real title available?)
• Maximum cycle packing using SPR-trees
• Packing disjoint cycles over vertex cuts

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177031)