Pages that link to "Item:Q805630"
From MaRDI portal
The following pages link to An upper bound on the shortness exponent of 1-tough, maximal planar graphs (Q805630):
Displaying 12 items.
- Non-Hamiltonian 1-tough triangulations with disjoint separating triangles (Q777448) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- Maximum and minimum toughness of graphs of small genus (Q1356471) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs (Q1690216) (← links)
- Toughness and Hamiltonicity of a class of planar graphs (Q1883251) (← links)
- Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs (Q1910531) (← links)
- On the shortness exponent of 1-tough, maximal planar graphs (Q1918570) (← links)
- Toughness and nonhamiltonicity of polyhedral graphs (Q2366022) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- (Q5708558) (← links)
- Toughness and spanning trees in K4‐minor‐free graphs (Q6055399) (← links)
