The Hamiltonian circuit problem for circle graphs is NP-complete
type: Item
instance of: scholarly article
title: The Hamiltonian circuit problem for circle graphs is NP-complete
zbMATH Open document ID: 0681.68062
DOI: 10.1016/0020-0190(89)90059-8
author: Peter Damaschke
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 4115967
zbMATH Keywords: Hamiltonian circuit
zbMATH Keywords: circle graphs
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90059-8
OpenAlex ID: W2052982152
cites work: Hamiltonian circuits in interval graph generalizations
cites work: Domination in convex and chordal bipartite graphs
cites work: The edge inducibility of graphs
cites work: Hamilton Paths in Grid Graphs
cites work: The NP-completeness column: an ongoing guide
description: scientific article; zbMATH DE number 4115967