Finding Hamiltonian cycles in certain planar graphs
type: Item
instance of: scholarly article
title: Finding Hamiltonian cycles in certain planar graphs
zbMATH Open document ID: 0703.68079
DOI: 10.1016/0020-0190(90)90053-Z
author: Robert J. Cimikowski
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4153907
zbMATH Keywords: design of algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: planar graph
zbMATH Keywords: Hamiltonian cycle
MaRDI profile type: Publication
cites work: Q4091421
cites work: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
cites work: An upper bound on the shortness exponent of inscribable polytopes
cites work: Q4198056
cites work: Parallel concepts in graph theory
cites work: Finding the intersection of two convex polyhedra
cites work: Q3992847
cites work: Q3875133
cites work: Some properties of the planar Euclidean relative neighbourhood graph
cites work: Embedding planar graphs in four pages
full work available at URL: 0020-0190(90)90053-z
OpenAlex ID: W1967785775
description: scientific article; zbMATH DE number 4153907