Chvátal's t₀-tough conjecture

DOI10.1007/978-3-319-31940-7_9MaRDI QIDQ5506780zbMATH OpenOpenAlexFDO

Authors Linda Lesniak

Publication date 16 December 2016

Published in Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-31940-7_9

zbMATH Keywords

connectivityHamiltonicitytoughness

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Extremal problems in graph theory (05C35) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 434902
• Toughness, minimum degree, and the existence of 2‐factors
• Not every 2-tough graph is Hamiltonian
• Tough graphs and Hamiltonian circuits.
• Toughness and edge-toughness

Cites work

• 1-tough cocomparability graphs are hamiltonian
• A Theorem on Planar Graphs
• Finding Hamiltonian circuits in interval graphs
• Graph Classes: A Survey
• Hamilton cycles in 5-connected line graphs
• Hamiltonian results inK1,3-free graphs
• scientific article; zbMATH DE number 4043881 (Why is no real title available?)
• scientific article; zbMATH DE number 1124477 (Why is no real title available?)
• More than one tough chordal planar graphs are Hamiltonian
• Not every 2-tough graph is Hamiltonian
• On a closure concept in claw-free graphs
• On hamiltonian line graphs and connectivity
• On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
• Recognizing tough graphs is NP-hard
• Reflections on graph theory
• The square of every two-connected graph is Hamiltonian
• Tough graphs and Hamiltonian circuits.
• Tough spiders
• Toughness and Hamiltonicity in k-trees
• Toughness and the existence ofk-factors
• Toughness in graphs -- a survey
• Toughness, hamiltonicity and split graphs

Cited in

(4)

• Toughness and edge-toughness
• Toughness in graphs -- a survey
• scientific article; zbMATH DE number 434902 (Why is no real title available?)
• Toughness, minimum degree, and the existence of 2‐factors

This page was built for publication: Chvátal's \(t_{0}\)-tough conjecture

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