✦ LIBER ✦

Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture

✍ Scribed by Dor, Dorit; Tarsi, Michael

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The proof of Ushio’s conjecture concerni

✍ Beiliang Du; Jian Wang 📂 Article 📅 2006 🏛 SP Science China Press 🌐 English ⚖ 205 KB

Deciding whether a planar graph has a cu

✍ Iain A. Stewart 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 505 KB

On the Planar Decomposition of a Complet

✍ Shirakawa, Isao; Takahashi, Hiromitsu; Ozaki, Hiroshi 📂 Article 📅 1968 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 713 KB

Decomposition of a complete graph into t

✍ A. Bouchet; R. Lopez-Bracho 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Sparse complete sets for NP: Solution of

✍ Stephen R. Mahaney 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 942 KB

On the decomposition of a complete graph

✍ Isao Shirakawa; Hiromitsu Takahashi; Hiroshi Ozaki 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 692 KB