✦ LIBER ✦

The Hamiltonian circuit problem for circle graphs is NP-complete

✍ Scribed by Peter Damaschke

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The edge Hamiltonian path problem is NP-

✍ Ten-Hwang Lai; Shu-Shang Wei 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 508 KB

The graph genus problem is NP-complete

✍ Carsten Thomassen 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 471 KB

The node-deletion problem for hereditary

✍ John M. Lewis; Mihalis Yannakakis 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 801 KB