Pages that link to "Item:Q3031944"
From MaRDI portal
The following pages link to The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs (Q3031944):
Displaying 33 items.
- On \(k\)-greedy routing algorithms (Q283869) (← links)
- Two-page book embeddings of 4-planar graphs (Q300468) (← links)
- Guthrie's problem: new equivalences and rapid reductions (Q672855) (← links)
- Graphs generalizing closed curves with linear construction of the Hamiltonian cycle (Q673065) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489) (← links)
- Connectivity of plane triangulations (Q911313) (← links)
- Finding Hamiltonian cycles in certain planar graphs (Q916416) (← links)
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments (Q1200910) (← links)
- Guarding rectangular art galleries (Q1326753) (← links)
- Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- Chinese remainder encoding for Hamiltonian cycles (Q2118300) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs (Q2308511) (← links)
- 4-connected projective-planar graphs are Hamiltonian-connected (Q2343285) (← links)
- On certain Hamiltonian inner triangulations (Q2367404) (← links)
- Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
- 2-edge-Hamiltonian-connectedness of 4-connected plane graphs (Q2509769) (← links)
- Circumscribing polygons and polygonizations for disjoint line segments (Q2671176) (← 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)
- 5-Connected Toroidal Graphs are Hamiltonian-Connected (Q3462548) (← links)
- Problems on pairs of trees and the four colour problem of planar graphs (Q4630251) (← links)
- (Q4691817) (← links)
- Computing Tutte Paths (Q5002780) (← links)
- (Q5075803) (← links)
- (Q5088936) (← links)
- AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS (Q5249271) (← links)
- Universal hinge patterns for folding strips efficiently into any grid polyhedron (Q5918984) (← links)
- Find subtrees of specified weight and cycles of specified length in linear time (Q6056757) (← links)
- A note on Hamiltonian cycles in planar graphs (Q6174139) (← links)
