✦ LIBER ✦

The complexity of generalized graph colorings

✍ Scribed by Jason I. Brown

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 1004 KB
Volume: 69
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(96)00096-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On generalized graph colorings

✍ Jason I. Brown; Derek G. Corneil 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 610 KB

Given a property P, graph G. and k 2 0, a P k-coloring is a function 7r: V(G) + { I , ... , k) such that the subgraph induced by each color class has property P; x ( G : P ) is the least k, for which G has a P k-coloring. We investigate here the theory of P colorings. Generalizations of the wellknow

Algorithmic complexity of list colorings

✍ Jan Kratochvíl; Zsolt Tuza 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 420 KB

Generalized local colorings of graphs

✍ Miroslaw Truszczyński 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Even edge colorings of a graph

✍ B. Devadas Acharya 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 78 KB

Even edge colorings of a graph

✍ Noga Alon; Yoshimi Egawa 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 59 KB

A generalization of edge-coloring in gra

A generalization of edge-coloring in graphs

✍ S. Louis Hakimi; Oded Kariv 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 754 KB

Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex u at most m(u) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(u) = 1 for all