Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor

DOI10.1137/15M1045144zbMath1350.05132arXiv1509.07430MaRDI QIDQ2832575

Barbora Candráková, Robert Lukot'ka

Publication date: 11 November 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.07430

zbMATH Keywords

cubic graphsnarkshort cycle cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Short cycle covers of graphs with at most 77\% vertices of degree two ⋮ Cubic Graphs with No Short Cycle Covers ⋮ Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shortest coverings of graphs with cycles
• Short circuit covers for regular matroids with a nowhere zero 5-flow
• Flows and generalized coloring theorems in graphs
• Short cycle covers and the cycle double cover conjecture
• Small snarks with large oddness
• A note on shortest cycle covers of cubic graphs
• Short Cycle Covers of Graphs with Minimum Degree Three
• Short cycle covers of graphs and nowhere-zero flows
• Covering Multigraphs by Simple Circuits
• Avoiding 5-Circuits in 2-Factors of Cubic Graphs
• Maximum matching and a polyhedron with 0,1-vertices
• Polyhedral decompositions of cubic graphs

This page was built for publication: Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor