Chordality and 2-factors in tough graphs

DOI10.1016/S0166-218X(99)00142-0MaRDI QIDQ1962052zbMATH OpenOpenAlexWikidataFDO

Authors D. Bauer, Gyula Y. Katona, Dieter Kratsch, 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)

Recommendations

• Toughness and the existence ofk-factors
• Forbidden subgraphs and 2‐factors in 3/2‐tough graphs
• scientific article; zbMATH DE number 165068
• More than one tough chordal planar graphs are Hamiltonian
• Toughness, degrees and 2-factors

Cites work

• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1124477 (Why is no real title available?)
• scientific article; zbMATH DE number 861394 (Why is no real title available?)
• scientific article; zbMATH DE number 867682 (Why is no real title available?)
• Not every 2-tough graph is Hamiltonian
• Reguläre Faktoren von Graphen.
• The Factors of Graphs
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• Toughness, hamiltonicity and split graphs
• Toughness, minimum degree, and the existence of 2‐factors

Cited in

(10)

• Toughness in graphs -- a survey
• Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
• scientific article; zbMATH DE number 2230266 (Why is no real title available?)
• Toughness and Hamiltonicity in k-trees
• Toughness and Hamiltonicity of a class of planar graphs
• 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
• On 2-walks in chordal planar graphs
• Not every 2-tough graph is Hamiltonian

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

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