scientific article

DOI<341::AID-JGT6>3.0.CO;2-O 10.1002/(SICI)1097-0118(199704)24:4<341::AID-JGT6>3.0.CO;2-OzbMath0880.05059MaRDI QIDQ3129827

Daniel P. Sanders

Publication date: 22 April 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamiltonian cycleplane graphHamilton pathsTutte path

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (39)

Cycles in 4-connected planar graphs ⋮ A theorem on paths in locally planar triangulations ⋮ Two-page book embeddings of 4-planar graphs ⋮ Every 5-connected planar triangulation is 4-ordered Hamiltonian ⋮ A survey on book-embedding of planar graphs ⋮ Each maximal planar graph with exactly two separating triangles is Hamiltonian ⋮ 5-Connected Toroidal Graphs are Hamiltonian-Connected ⋮ Every 4-Connected Graph with Crossing Number 2 is Hamiltonian ⋮ Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian ⋮ Computing Tutte Paths ⋮ Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators ⋮ On 2-connected spanning subgraphs with low maximum degree ⋮ On 1-Hamilton-connected claw-free graphs ⋮ On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ Rooted minors and locally spanning subgraphs ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Prescribed edges and forbidden edges for a cycle in a planar graph ⋮ On longest cycles in essentially 4-connected planar graphs ⋮ On longest cycles in essentially 4-connected planar graphs ⋮ How many conjectures can you stand? A survey ⋮ Polyhedra with few 3-cuts are Hamiltonian ⋮ On the matching extendability of graphs in surfaces ⋮ A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs ⋮ Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs ⋮ Unnamed Item ⋮ A note on traversing specified vertices in graphs embedded with large representativity ⋮ Unnamed Item ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ Longer cycles in essentially 4-connected planar graphs ⋮ 2-edge-Hamiltonian-connectedness of 4-connected plane graphs ⋮ Long cycles in 4-connected planar graphs ⋮ Types of triangle in Hamiltonian triangulations and an application to domination and k-walks ⋮ Unnamed Item ⋮ Book Embedding of Graphs on the Projective Plane ⋮ A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs ⋮ $K_2$-Hamiltonian Graphs: I ⋮ 4-connected projective-planar graphs are Hamiltonian-connected ⋮ Hamiltonian-connectedness of triangulations with few separating triangles

This page was built for publication: