✦ LIBER ✦

NP-completeness of interval graph completion from a path graph

✍ Scribed by Kazuaki Yamaguchi; Toshiro Araki; Toshinobu Kashiwabara

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognizing graphs with fixed interval n

✍ Douglas B. West; David B. Shmoys 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 722 KB

NP-Completeness of graph decomposition p

✍ Edith Cohen; Michael Tarsi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 689 KB

Achromatic number is NP-complete for cog

✍ Hans L. Bodlaender 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 477 KB

The edge Hamiltonian path problem is NP-

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

NP-completeness and APX-completeness of

✍ Lei Chen; Weiming Zeng; Changhong Lu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Graph Decomposition is NP-Complete: A Co

✍ Dor, Dorit; Tarsi, Michael 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 472 KB