Tough graphs and Hamiltonian circuits. (Reprint)

DOI10.1016/j.disc.2006.03.011zbMath1095.05021OpenAlexW4210762532MaRDI QIDQ2497990

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

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

Related Items (6)

The vertex attack tolerance of complex networks ⋮ Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy ⋮ The structure of minimally \(t\)-tough, \(2K_2\)-free graphs ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Non-Hamiltonian triangulations with distant separating triangles ⋮ Algebraic conditions for t-tough graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Hamilton's ideals
• A note on Hamiltonian circuits
• A Theorem on Planar Graphs
• Graphs and Subgraphs
• Cycles and Connectivity in Graphs
• The square of every nonseparable graph is Hamiltonian
• Existence of k-edge connected ordinary graphs with prescribed degrees
• Some Theorems on Abstract Graphs
• A Short Proof of the Factor Theorem for Finite Graphs

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