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

DOI10.1016/j.disc.2007.11.026zbMath1157.05041OpenAlexW2176625698WikidataQ122905689 ScholiaQ122905689MaRDI QIDQ998345

Roman Kužel, Tomáš Kaiser, Zdeněk Ryjáček, Gašper Fijavž, Petr Vrána, Hajo J. 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

Hamiltonian graphcubic graphline graphsnarkdominating cyclecontractible graph

Mathematics Subject Classification ID

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

Related Items (9)

Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs ⋮ Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs ⋮ Strongly even cycle decomposable 4-regular line graphs ⋮ Thomassen's conjecture for line graphs of 3-hypergraphs ⋮ Hamilton cycles in 5-connected line graphs ⋮ How many conjectures can you stand? A survey ⋮ What is on his mind? ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Equivalence of Jackson's and Thomassen's conjectures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a closure concept in claw-free graphs
• Equivalence of Fleischner's and Thomassen's conjectures
• Hamiltonian results inK1,3-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Reflections on graph theory
• Contractibility techniques as a closure concept
• Decompositions and reductions of snarks
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Characterizations of derived graphs

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