Chordality and 2-factors in tough graphs

DOI10.1016/S0166-218X(99)00142-0zbMath0937.68094OpenAlexW2113050592WikidataQ127679068 ScholiaQ127679068MaRDI QIDQ1962052

Dieter Kratsch, Douglas Bauer, Gyula Y. Katona, Henk Jan Veldman

Publication date: 30 January 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00142-0

zbMATH Keywords

chordal graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (8)

Toughness and Hamiltonicity in \(k\)-trees ⋮ Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs ⋮ Forbidden subgraphs and 2‐factors in 3/2‐tough graphs ⋮ Existence of 2-factors in tough graphs without forbidden subgraphs ⋮ Not every 2-tough graph is Hamiltonian ⋮ Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs ⋮ Toughness in graphs -- a survey ⋮ Unnamed Item

Cites Work

• Toughness, hamiltonicity and split graphs
• Not every 2-tough graph is Hamiltonian
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• Toughness, minimum degree, and the existence of 2‐factors
• Reguläre Faktoren von Graphen.
• The Factors of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chordality and 2-factors in tough graphs