A note on shortest cycle covers of cubic graphs

DOI10.1002/jgt.20636zbMath1250.05087OpenAlexW1505029522MaRDI QIDQ2911057

Cun-Quan Zhang, Xin Min Hou

Publication date: 12 September 2012

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

Full work available at URL: https://doi.org/10.1002/jgt.20636

zbMATH Keywords

2-factorperfect matchingcycle covershortest cycle cover

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs ⋮ Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor

Cites Work

• Shortest coverings of graphs with cycles
• Flows and generalized coloring theorems in graphs
• Short cycle covers and the cycle double cover conjecture
• Shortest circuit covers of cubic graphs
• Short Cycle Covers of Graphs with Minimum Degree Three
• Covering Multigraphs by Simple Circuits
• Short cycle covers of cubic graphs
• Maximum matching and a polyhedron with 0,1-vertices
• Polyhedral decompositions of cubic graphs

This page was built for publication: A note on shortest cycle covers of cubic graphs