Pages that link to "Item:Q1143414"
From MaRDI portal
The following pages link to A 1-tough nonhamiltonian maximal planar graph (Q1143414):
Displaying 16 items.
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- Non-Hamiltonian 1-tough triangulations with disjoint separating triangles (Q777448) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs (Q805630) (← links)
- Planar graphs, Hamilton cycles and extreme independence number (Q1339131) (← links)
- Non-Hamiltonian triangulations with distant separating triangles (Q1752660) (← 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)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
- The number of defective colorings of graphs on surfaces (Q3174242) (← links)
- On the Toughness of a Graph (Q3490022) (← links)
- (Q5708558) (← links)
- The structure of minimally \(t\)-tough, \(2K_2\)-free graphs (Q6153459) (← links)
