Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks

DOI10.1016/J.DISC.2007.11.026MaRDI QIDQ998345zbMATH OpenOpenAlexWikidataFDO

Authors Gašper Fijavž, Tomáš Kaiser, Roman Kužel, Zdeněk Ryjáček, Petr Vrána, Hajo Broersma

Publication date 28 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://research.utwente.nl/en/publications/contractible-subgraphs-thomassens-conjecture-and-the-dominating-cycle-conjecture-for-snarks(9711667c-fd2a-44d0-aaaa-6748f62a7ee8).html

zbMATH Keywords

line graphcubic graphHamiltonian graphsnarkdominating cyclecontractible graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38)

Recommendations

• Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
• Stable dominating circuits in snarks
• Hamilton cycles in 5-connected line graphs
• A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
• A note about the dominating circuit conjecture

Cites work

• scientific article; zbMATH DE number 3885954 (Why is no real title available?)
• scientific article; zbMATH DE number 4108816 (Why is no real title available?)
• A reduction method to find spanning Eulerian subgraphs
• Characterizations of derived graphs
• Contractibility techniques as a closure concept
• Decompositions and reductions of snarks
• Equivalence of Fleischner's and Thomassen's conjectures
• Graph theory
• Hamiltonian results inK1,3-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On a closure concept in claw-free graphs
• Reflections on graph theory

Cited in

(12)

• Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
• How many conjectures can you stand? A survey
• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
• Hamilton cycles in 5-connected line graphs
• Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
• Thomassen's conjecture for line graphs of 3-hypergraphs
• Strongly even cycle decomposable 4-regular line graphs
• What is on his mind?
• Perfect pseudo-matchings in cubic graphs
• Equivalence of Jackson's and Thomassen's conjectures
• Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
• A note about the dominating circuit conjecture

This page was built for publication: Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks

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