Non-Hamiltonian triangulations with distant separating triangles
From MaRDI portal
Recommendations
- Non-Hamiltonian 1-tough triangulations with disjoint separating triangles
- Hamiltonian-connectedness of triangulations with few separating triangles
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments
- Nonhamiltonian triangulations with large connectivity and representativity
- Hamiltonian cycles in planar triangulations with no separating triangles
- On the number of Hamiltonian cycles in triangulations with few separating triangles
- Non-geometric veering triangulations
- ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
- On hamiltonian triangulations in simple polygons (Extended Abstract)
- Nonobtuse triangulation of polygons
Cites work
- scientific article; zbMATH DE number 889961 (Why is no real title available?)
- 4-connected projective planar graphs are Hamiltonian
- A 1-tough nonhamiltonian maximal planar graph
- A Theorem on Planar Graphs
- Hamilton cycles in plane triangulations
- On Hamiltonian cycles in 4- and 5-connected plane triangulations
- On certain Hamiltonian cycles in planar graphs
- Tough graphs and Hamiltonian circuits. (Reprint)
Cited in
(4)
This page was built for publication: Non-Hamiltonian triangulations with distant separating triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752660)