Short cycle covers of graphs with at most 77\% vertices of degree two

DOI10.37236/9284zbMath1453.05053OpenAlexW3110087965MaRDI QIDQ2213807

Anna Kompišová, Robert Lukot'ka

Publication date: 3 December 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/9284

zbMATH Keywords

cycle double cover conjectureFan's construction

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Vertex degrees (05C07)

Cites Work

• Shortest coverings of graphs with cycles
• Flows and generalized coloring theorems in graphs
• Eulerian graphs and related topics. Part 1, Volume 1
• Short cycle covers and the cycle double cover conjecture
• Integer 4-flows and cycle covers
• 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
• Graphic TSP in cubic graphs
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Short cycle covers of graphs with at most 77\% vertices of degree two