Pages that link to "Item:Q788489"

The following pages link to A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489):

Displaying 11 items.

• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
• Connectivity of plane triangulations (Q911313) (← 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)
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
• Computing Tutte Paths (Q5002780) (← links)
• (Q5091172) (← links)
• On the visibility graph of convex translates (Q5951963) (← links)