Pages that link to "Item:Q1916113"
From MaRDI portal
The following pages link to Toughness, hamiltonicity and split graphs (Q1916113):
Displaying 41 items.
- 10-tough chordal graphs are Hamiltonian (extended abstract) (Q322253) (← links)
- 10-tough chordal graphs are Hamiltonian (Q345090) (← links)
- Some properties of \(k\)-trees (Q708399) (← links)
- Toughness and Hamiltonicity in \(k\)-trees (Q868350) (← links)
- Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs (Q960979) (← links)
- Bipartite toughness and \(k\)-factors in bipartite graphs (Q1008540) (← links)
- Hamiltonian powers in threshold and arborescent comparability graphs (Q1301703) (← links)
- Toughness and edge-toughness (Q1356703) (← links)
- 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- The toughness of split graphs (Q1584388) (← links)
- Long paths and toughness of \(k\)-trees and chordal planar graphs (Q1618219) (← links)
- Hamilton cycles and eigenvalues of graphs (Q1899443) (← links)
- Chordality and 2-factors in tough graphs (Q1962052) (← links)
- Toughness, forbidden subgraphs and pancyclicity (Q2045380) (← links)
- Connected even factors in \(k\)-tree (Q2053544) (← links)
- Toughness, forbidden subgraphs, and Hamilton-connected graphs (Q2062680) (← links)
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs (Q2124619) (← links)
- Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs (Q2227834) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- On the Burkard-Hammer condition for Hamiltonian split graphs (Q2484370) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- The completion of a classification for maximal nonhamiltonian Burkard-Hammer graphs (Q2510574) (← links)
- The complexity of recognizing minimally tough graphs (Q2656956) (← links)
- Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs (Q2675828) (← links)
- Hamiltonicity in Split Graphs - A Dichotomy (Q2971662) (← links)
- A necessary condition for maximal nonhamiltonian Burkard-Hammer graphs (Q3410898) (← links)
- On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs (Q5417820) (← links)
- Chvátal’s t 0-Tough Conjecture (Q5506780) (← links)
- (Q5708558) (← links)
- On Hamiltonian properties of \(K_{1, r}\)-free split graphs (Q6041859) (← links)
- Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs (Q6046653) (← links)
- Toughness and Hamiltonicity of strictly chordal graphs (Q6070991) (← links)
- Forbidden subgraphs and 2‐factors in 3/2‐tough graphs (Q6074577) (← links)
- Two completely independent spanning trees of split graphs (Q6094714) (← links)
- Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy (Q6114853) (← links)
- Minimal toughness in special graph classes (Q6599813) (← links)
- Spanning connectivity of \(K_{1 , r}\)-free split graphs (Q6611066) (← links)
- Toughness and spectral radius in graphs (Q6611738) (← links)
- An efficient algorithm to compute the toughness in graphs with bounded treewidth (Q6616440) (← links)
- The chromaticity of complete split graphs (Q6647871) (← links)
