Cuts in matchings of 3-connected cubic graphs

DOI10.1016/j.ejc.2018.09.004zbMath1402.05128arXiv1712.06143OpenAlexW2963900885WikidataQ129124143 ScholiaQ129124143MaRDI QIDQ1633599

Petru Valicov, Kolja Knauer

Publication date: 20 December 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonicity in cubic graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

On the dichromatic number of surfaces ⋮ The minimality of the Georges–Kelmans graph ⋮ Four proofs of the directed Brooks' theorem

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian cycles in cubic 3-connected bipartite planar graphs
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Non-Hamiltonian bicubic graphs
• On two-factors of bipartite regular graphs
• A flow theory for the dichromatic number
• On the 2-factors of bicubic graphs
• Cubic Graphs with Large Circumference Deficit
• Fast generation of cubic graphs
• Planar Digraphs of Digirth Four are 2-Colorable
• On Hamiltonian Circuits

This page was built for publication: Cuts in matchings of 3-connected cubic graphs