Finding Hamiltonian cycles in certain planar graphs

DOI10.1016/0020-0190(90)90053-ZzbMath0703.68079OpenAlexW1967785775MaRDI QIDQ916416

Robert J. Cimikowski

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90053-z

zbMATH Keywords

combinatorial problemsdesign of algorithmsHamiltonian cycleplanar graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items

Planar drawings with few slopes of Halin graphs and nested pseudotrees, Finding Hamiltonian cycles in Delaunay triangulations is NP-complete, Small Point Sets for Simply-Nested Planar Graphs, Small universal point sets for \(k\)-outerplanar graphs, A linear time recognition algorithm for proper interval graphs, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding planar graphs in four pages
• An upper bound on the shortness exponent of inscribable polytopes
• Finding the intersection of two convex polyhedra
• Parallel concepts in graph theory
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• Some properties of the planar Euclidean relative neighbourhood graph