The Hamiltonian circuit problem for circle graphs is NP-complete

From MaRDI portal
Publication:1823687

DOI10.1016/0020-0190(89)90059-8zbMath0681.68062OpenAlexW2052982152MaRDI QIDQ1823687

Peter Damaschke

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90059-8



Related Items



Cites Work