Pages that link to "Item:Q1363656"
From MaRDI portal
The following pages link to 1-tough cocomparability graphs are hamiltonian (Q1363656):
Displaying 18 items.
- Some properties of \(k\)-trees (Q708399) (← links)
- Cyclability in graph classes (Q833007) (← links)
- Toughness and Hamiltonicity in \(k\)-trees (Q868350) (← links)
- Hamiltonian powers in threshold and arborescent comparability graphs (Q1301703) (← links)
- Vulnerability of subclasses of chordal graphs (Q1742199) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs (Q2675828) (← links)
- The scattering number of thorn graphs (Q4831402) (← links)
- (Q5037233) (← links)
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
- On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs (Q5417820) (← links)
- Toughness and Hamiltonicity of strictly chordal graphs (Q6070991) (← links)
- Assistance and interdiction problems on interval graphs (Q6094722) (← links)
- Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs (Q6184533) (← links)
