✦ LIBER ✦

The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem

✍ Scribed by Manber, Udi; Tompa, Martin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximizing the number of unused colors i

✍ Refael Hassin; Shlomo Lahav (Haddad) 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 321 KB

The number of Hamiltonian paths and cycl

✍ David A Klarner 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 239 KB

On the advice complexity of the online L

✍ Bianchi, Maria Paola; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Krug, Sacha; 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 574 KB

On the complexity of the general colorin

✍ H.A. Maurer; J.H. Sudborough; E. Welzl 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 664 KB

On the complexity of vertex-disjoint len

✍ Andreas Bley 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 277 KB

On the complexity of a restricted list-c

✍ Moshe Dror; Gerd Finke; Sylvain Gravier; Wieslaw Kubiak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 355 KB