Pages that link to "Item:Q788489"
From MaRDI portal
The following pages link to A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489):
Displaying 21 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Finding and enumerating Hamilton cycles in 4-regular graphs (Q638522) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- A data structure useful for finding Hamiltonian cycles (Q909446) (← links)
- Connectivity of plane triangulations (Q911313) (← links)
- Finding Hamiltonian cycles in certain planar graphs (Q916416) (← links)
- Parameterized algorithms in smooth 4-regular Hamiltonian graphs (Q943003) (← links)
- Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs (Q968420) (← links)
- A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments (Q1200910) (← links)
- An extension of Whitney's theorem to infinite strong triangulations (Q1341252) (← links)
- The visibility graph of congruent discs is Hamiltonian (Q1873692) (← links)
- A new algorithm for embedding plane graphs at fixed vertex locations (Q2121749) (← links)
- Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
- Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time (Q2673969) (← links)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs (Q3031944) (← links)
- Computing Tutte Paths (Q5002780) (← links)
- (Q5091172) (← links)
- On the visibility graph of convex translates (Q5951963) (← links)
- A note on Hamiltonian cycles in planar graphs (Q6174139) (← links)
