✦ LIBER ✦

On the complexity of the general coloring problem

✍ Scribed by H.A. Maurer; J.H. Sudborough; E. Welzl

Book ID: 118530908
Publisher: Elsevier Science
Year: 1981
Weight: 664 KB
Volume: 51
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(81)90226-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of a restricted list-c

On the complexity of a restricted list-coloring problem

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

The complexity of nonrepetitive coloring

✍ Dániel Marx; Marcus Schaefer 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 549 KB

On the max coloring problem

✍ Epstein, Leah; Levin, Asaf 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 380 KB

The Effect of Number of Hamiltonian Path

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

✍ Manber, Udi; Tompa, Martin 📂 Article 📅 1984 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 900 KB

The complexity of the T-coloring problem

The complexity of the T-coloring problem for graphs with small degree

✍ Krzysztof Giaro; Robert Janczewski; Michał Małafiejski 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 194 KB

In the paper we consider a generalized vertex coloring model, namely T -coloring. For a given ÿnite set T of nonnegative integers including 0, a proper vertex coloring is called a T -coloring if the distance of the colors of adjacent vertices is not an element of T . This problem is a generalization

The complexity of minimum convex colorin

The complexity of minimum convex coloring

✍ Frank Kammer; Torsten Tholey 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 796 KB