The following pages link to (Q4967194):
Displaying 7 items.
- Long paths and toughness of \(k\)-trees and chordal planar graphs (Q1618219) (← links)
- Vulnerability of subclasses of chordal graphs (Q1742199) (← links)
- Toughness, forbidden subgraphs and pancyclicity (Q2045380) (← links)
- Toughness, forbidden subgraphs, and Hamilton-connected graphs (Q2062680) (← links)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- Toughness and Hamiltonicity of strictly chordal graphs (Q6070991) (← links)
- An efficient algorithm to compute the toughness in graphs with bounded treewidth (Q6616440) (← links)