… graph coloring is considered, we have already mentioned Karp's NP-hardness proof of
vertex-coloring … Johnson (97) who proved that finding a coloring of value not worse than twice the …

… Ak-coloring ofG π is an assignment to its vertices of integers … a mixed graph is the smallestk
such thatG π admits ak-coloring. … and general graphs, and report computational experience. …

… We say Nis chromatic if it has a coloring and achromatic if it has none. A chromatic chain-group
is necessarily full. … Before doing this however we show that some of the best known …

… For an ordering v1,v2,...,vn of the vertices V of G, a sequential coloring of G corre- Graph
Coloring Algorithms III sponding to this order is ak coloring of G utilizing each of the colors 1,2,...…

… G and H, we say that G is H-colorable, if there is a graph homomorphism from G into H; that
… that the H-coloring problem is polynomial time decidable for some fixed graphs H. Among …

… graph coloring problem. We consider defective colorings, ie, colorings where nodes of a
color class may induce a graph of maximum degree d for some parameter d > 0. We also look at …

… coloring to a larger one is a natural approach in various contexts where graph colorings
are … have always been special objects in the study of graph colorings. The paper by Erdos, …

… The goal of the current monograph is to cover most of these developments, and as a result
to provide a treatise on theoretical foundations of distributed graph coloring, MIS, and related …

… graph colorings in the light of scheduling problems with the makespan criterion. A mixed
graph … In 1997 [10], another mixed graph coloring (we call it a strict mixed graph coloring) was …

… has a P k-coloring. We investigate here the theory of P colorings. Generalizations of the well…
unique colorability are discussed, and we extend a theorem of Erdos to Pchromatic graphs. …