Chordality and 2-factors in tough graphs
From MaRDI portal
Publication:1962052
DOI10.1016/S0166-218X(99)00142-0zbMath0937.68094MaRDI QIDQ1962052
Dieter Kratsch, Gyula Y. Katona, Douglas Bauer, Henk Jan Veldman
Publication date: 30 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Unnamed Item, Toughness and Hamiltonicity in \(k\)-trees, Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs, Not every 2-tough graph is Hamiltonian, Toughness in graphs -- a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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