Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits

DOI10.1137/19M1241866zbMath1430.05097arXiv1901.10718OpenAlexW2999456968WikidataQ126355837 ScholiaQ126355837MaRDI QIDQ5210904

Robert Lukot'ka

Publication date: 16 January 2020

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

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

zbMATH Keywords

cubic graphcycle covershort cycle cover

Mathematics Subject Classification ID

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 ⋮ Cubic Graphs with No Short Cycle Covers

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest coverings of graphs with cycles
• Flows and generalized coloring theorems in graphs
• Short cycle covers and the cycle double cover conjecture
• Integer 4-flows and cycle covers
• Small snarks with large oddness
• Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor
• Short Cycle Covers of Graphs with Minimum Degree Three
• Covering Multigraphs by Simple Circuits
• Maximum matching and a polyhedron with 0,1-vertices
• Polyhedral decompositions of cubic graphs

This page was built for publication: Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits