The following pages link to On paths in planar graphs (Q3129827):
Displaying 50 items.
- Two-page book embeddings of 4-planar graphs (Q300468) (← links)
- Every 5-connected planar triangulation is 4-ordered Hamiltonian (Q307916) (← links)
- On 1-Hamilton-connected claw-free graphs (Q394533) (← links)
- The path relation for directed planar graphs in rectangles, and its relation to the free diad (Q626863) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- A note on traversing specified vertices in graphs embedded with large representativity (Q709309) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- A new proof that 4-connected planar graphs are Hamiltonian-connected (Q726634) (← links)
- Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs (Q968420) (← links)
- Long cycles in 4-connected planar graphs (Q1011776) (← links)
- A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs (Q1044928) (← links)
- On 2-connected spanning subgraphs with low maximum degree (Q1127880) (← links)
- Paths on polymatroids (Q1196722) (← links)
- Paths and metrics in a planar graph with three or more holes. I: Metrics (Q1322003) (← links)
- Paths and metrics in a planar graph with three or more holes. II: Paths (Q1322004) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- Polyhedra with few 3-cuts are Hamiltonian (Q1732035) (← links)
- Cycles in 4-connected planar graphs (Q1883288) (← links)
- A theorem on paths in locally planar triangulations (Q1883289) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Longer cycles in essentially 4-connected planar graphs (Q2282479) (← links)
- 4-connected projective-planar graphs are Hamiltonian-connected (Q2343285) (← links)
- Each maximal planar graph with exactly two separating triangles is Hamiltonian (Q2383540) (← links)
- Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
- Prescribed edges and forbidden edges for a cycle in a planar graph (Q2446300) (← links)
- On the matching extendability of graphs in surfaces (Q2464156) (← links)
- Hamilton paths in toroidal graphs (Q2485945) (← links)
- 2-edge-Hamiltonian-connectedness of 4-connected plane graphs (Q2509769) (← links)
- Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian (Q2662552) (← links)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
- (Q2979707) (← links)
- Hamiltonian-connectedness of triangulations with few separating triangles (Q3299370) (← links)
- 5-Connected Toroidal Graphs are Hamiltonian-Connected (Q3462548) (← links)
- Paths of low weight in planar graphs (Q3527531) (← links)
- Every 4-Connected Graph with Crossing Number 2 is Hamiltonian (Q4561263) (← links)
- (Q4664110) (← links)
- On the Characterization of Plane Bus Graphs (Q4924639) (← links)
- Computing Tutte Paths (Q5002780) (← links)
- $K_2$-Hamiltonian Graphs: I (Q5009329) (← links)
- (Q5075803) (← links)
- Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators (Q5088601) (← links)
- (Q5091172) (← links)
- Types of triangle in Hamiltonian triangulations and an application to domination and k-walks (Q5217058) (← links)
- Book Embedding of Graphs on the Projective Plane (Q5237910) (← links)
- (Q5374240) (← links)
- A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs (Q5417830) (← links)
- Infinite paths in planar graphs III, 1-way infinite paths (Q5469138) (← links)
- On longest cycles in essentially 4-connected planar graphs (Q5892303) (← links)
- On longest cycles in essentially 4-connected planar graphs (Q5895079) (← links)
- A theorem on paths in planar graphs (Q5903317) (← links)
