Tough graphs and Hamiltonian circuits. (Reprint)

DOI10.1016/J.DISC.2006.03.011MaRDI QIDQ2497990zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 4 August 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.03.011

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Tough graphs and Hamiltonian circuits.
• Hamiltonian degree conditions for tough graphs
• A sufficient condition for Hamiltonian cycles in tough graphs
• Hamiltonian cycles in 1-tough graphs
• scientific article; zbMATH DE number 68618
• Toughness, minimum degree, and the existence of 2‐factors
• Toughness, forbidden subgraphs, and Hamilton-connected graphs
• Toughness and Hamiltonicity of a class of planar graphs
• scientific article; zbMATH DE number 4193714
• Toughness, hamiltonicity and split graphs

Cites work

• scientific article; zbMATH DE number 3455294 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3293646 (Why is no real title available?)
• scientific article; zbMATH DE number 3297026 (Why is no real title available?)
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• A Short Proof of the Factor Theorem for Finite Graphs
• A Theorem on Planar Graphs
• A note on Hamiltonian circuits
• Cycles and Connectivity in Graphs
• Existence of k-edge connected ordinary graphs with prescribed degrees
• Graphs and Subgraphs
• On Hamilton's ideals
• Some Theorems on Abstract Graphs
• The square of every nonseparable graph is Hamiltonian

Cited in

(10)

• Tough graphs and Hamiltonian circuits.
• The structure of minimally \(t\)-tough, \(2K_2\)-free graphs
• Spectral conditions of pancyclicity for t-tough graphs
• Non-Hamiltonian triangulations with distant separating triangles
• Algebraic conditions for t-tough graphs
• Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
• The vertex attack tolerance of complex networks
• On the minimum degree of minimally t-tough, claw-free graphs
• Characterization of minimally \(t\)-tough, \(2 K_2\)-free graphs for \(1 < t \leq 2\)

This page was built for publication: Tough graphs and Hamiltonian circuits. (Reprint)

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