Cubic Graphs with No Short Cycle Covers

DOI10.1137/21M1399208zbMath1475.05151OpenAlexW3199234453MaRDI QIDQ5157388

Edita Máčajová, Martin Škoviera

Publication date: 18 October 2021

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

Full work available at URL: https://doi.org/10.1137/21m1399208

zbMATH Keywords

cubic graphsnarkcycle covercyclic connectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generation and properties of snarks
• Treelike snarks
• Shortest coverings of graphs with cycles
• Short cycle covers and the cycle double cover conjecture
• Integer 4-flows and cycle covers
• A note on Fouquet-Vanherpes question and Fulkerson conjecture
• Shortest cycle covers and cycle double covers with large 2-regular subgraphs
• Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor
• Circuit Double Cover of Graphs
• On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
• Short Cycle Covers of Graphs with Minimum Degree Three
• Minimal Cyclic-4-Connected Graphs
• Covering Multigraphs by Simple Circuits
• Short cycle covers of cubic graphs
• 1‐Factor and Cycle Covers of Cubic Graphs
• Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits

This page was built for publication: Cubic Graphs with No Short Cycle Covers