Chordality and 2-factors in tough graphs

DOI10.1016/S0166-218X(99)00142-0zbMATH Open0937.68094OpenAlexW2113050592WikidataQ127679068 ScholiaQ127679068MaRDI QIDQ1962052FDOQ1962052

Dieter Kratsch, D. 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

Recommendations

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

zbMATH Keywords

chordal graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Toughness, hamiltonicity and split graphs
• Not every 2-tough graph is Hamiltonian
• Tough graphs and Hamiltonian circuits.
• The Factors of Graphs
• Title not available (Why is that?)
• Toughness and the existence ofk-factors
• Reguläre Faktoren von Graphen.
• Title not available (Why is that?)
• Toughness, minimum degree, and the existence of 2‐factors

Cited In (10)

• Toughness in graphs -- a survey
• Title not available (Why is that?)
• Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
• Toughness and Hamiltonicity in \(k\)-trees
• Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs
• Toughness and Hamiltonicity of a class of planar 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)