Equivalence of Fleischner's and Thomassen's conjectures

DOI10.1006/JCTB.1999.1944zbMATH Open1027.05058OpenAlexW2068428641MaRDI QIDQ1569072FDOQ1569072

Authors: 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

cubic graphHamiltoniandominating cycle3-edge-coloring

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Reflections on graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey on snarks and new results: Products, reducibility and a computer search

Cited In (11)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569072)