✦ LIBER ✦

NP-completeness of a family of graph-colouring problems

✍ Scribed by Robert W. Irving

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NP-Completeness of graph decomposition p

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

NP-completeness of edge-colouring some r

✍ Leizhen Cai; John A. Ellis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 850 KB

NP-completeness of minimum spanner probl

✍ Leizhen Cai 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 544 KB

The complexity of some graph colouring p

✍ Keith Edwards 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 896 KB

NP-completeness of some problems of part

✍ B. Péroche 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 794 KB

NP-completeness of some edge-disjoint pa

✍ Jens Vygen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 446 KB