scientific article; zbMATH DE number 1124477

DOI<29::AID-NET4>3.0.CO;2-M 10.1002/(SICI)1097-0037(199801)31:1<29::AID-NET4>3.0.CO;2-MzbMath0894.90150MaRDI QIDQ4378526

Jenő Lehel, Michael S. Jacobson, André E. Kézdy, Guantao Chen

Publication date: 5 March 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamiltonian cycle18-tough chordal graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (20)

Long paths and toughness of \(k\)-trees and chordal planar graphs ⋮ Detour trees ⋮ 10-tough chordal graphs are Hamiltonian (extended abstract) ⋮ 10-tough chordal graphs are Hamiltonian ⋮ Toughness and Hamiltonicity in \(k\)-trees ⋮ Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs ⋮ Forbidden subgraphs and 2‐factors in 3/2‐tough graphs ⋮ Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs ⋮ A closure lemma for tough graphs and Hamiltonian degree conditions ⋮ More than one tough chordal planar graphs are Hamiltonian ⋮ Not every 2-tough graph is Hamiltonian ⋮ Chordality and 2-factors in tough graphs ⋮ Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs ⋮ On Toughness and Hamiltonicity of 2K₂‐Free Graphs ⋮ Some properties of \(k\)-trees ⋮ Toughness in graphs -- a survey ⋮ Unnamed Item ⋮ On 2-walks in chordal planar graphs ⋮ Chvátal’s t 0-Tough Conjecture ⋮ Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs

This page was built for publication: