scientific article; zbMATH DE number 1124477

DOI10.1002/(SICI)1097-0037(199801)31:1%3C29::AID-NET4%3E3.0.CO;2-MMaRDI QIDQ4378526zbMATH OpenFDO

Authors Guantao Chen, Michael Jacobson, André E. Kézdy, Jeno Lehel

Publication date 5 March 1998

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199801)31:1%3C29::AID-NET4%3E3.0.CO;2-M

zbMATH Keywords

18-tough chordal graphHamiltonian cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited in

(23)

• On 2-walks in chordal planar graphs
• Long paths and toughness of \(k\)-trees and chordal planar graphs
• Not every 2-tough graph is Hamiltonian
• Chordality and 2-factors in tough graphs
• Toughness in graphs -- a survey
• Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs
• Detour trees
• scientific article; zbMATH DE number 5936422 (Why is no real title available?)
• 10-tough chordal graphs are Hamiltonian (extended abstract)
• 10-tough chordal graphs are Hamiltonian
• More than one tough chordal planar graphs are Hamiltonian
• Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
• On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
• Chvátal's \(t_{0}\)-tough conjecture
• scientific article; zbMATH DE number 2230266 (Why is no real title available?)
• Forbidden subgraphs and 2‐factors in 3/2‐tough graphs
• Hamiltonicity of 1-tough (P₂ KP₁)-free graphs
• A closure lemma for tough graphs and Hamiltonian degree conditions
• A Fan-type condition for cycles in 1-tough and k-connected (P₂ kP₁)-free graphs
• Some properties of \(k\)-trees
• Every 2k-connected (P₂ kP₁)-free graph with toughness greater than one is Hamiltonian-connected
• Toughness and Hamiltonicity in k-trees
• Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs

This page was built for publication:

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