Equivalence of Fleischner's and Thomassen's conjectures

DOI10.1006/jctb.1999.1944zbMath1027.05058OpenAlexW2068428641MaRDI QIDQ1569072

Martin Kochol

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1944

zbMATH Keywords

Hamiltoniancubic graphdominating cycle3-edge-coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs ⋮ Hamilton cycles in 5-connected line graphs ⋮ Circumference of a graph and its distance dominating longest cycles ⋮ How many conjectures can you stand? A survey ⋮ On embeddings of snarks in the torus ⋮ Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks ⋮ A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs ⋮ On the dominating (induced) cycles of iterated line graphs ⋮ The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs ⋮ Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks ⋮ Equivalence of Jackson's and Thomassen's conjectures

Cites Work

• A survey on snarks and new results: Products, reducibility and a computer search
• Reflections on graph theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equivalence of Fleischner's and Thomassen's conjectures