✦ LIBER ✦

Relaxed Coloring of a Graph

✍ Scribed by Sunanda Bagchi

Publisher: Springer Japan
Year: 1998
Tongue: English
Weight: 82 KB
Volume: 14
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730050020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi-Balanced Colorings of Graphs: Gener

Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition

✍ Jesper Jansson; Takeshi Tokuyama 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 499 KB

Coloring graph products — A survey

✍ Sandi Klavẑar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 564 KB

There are four standard products of graphs: the direct product, the Cartesian product, the strong product and the lexicographic product. The chromatic number turned out to be an interesting parameter on all these products, except on the Cartesian one. A survey is given on the results concerning the

Asymmetric graph coloring games

✍ H. A. Kierstead 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract We introduce the (__a,b__)‐coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors __a__ vertices and Bob colors __b__ vertices. We also introduce a relat

A Simple Competitive Graph Coloring Algo

A Simple Competitive Graph Coloring Algorithm

✍ H.A. Kierstead 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 157 KB

We prove that the game coloring number, and therefore the game chromatic number, of a planar graph is at most 18. This is a slight improvement of the current upper bound of 19. Perhaps more importantly, we bound the game coloring number of a graph G in terms of a new parameter r(G). We use this resu

Coloring the square of a planar graph

✍ Jan van den Heuvel; Sean McGuinness 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

## Abstract We prove that for any planar graph __G__ with maximum degree Δ, it holds that the chromatic number of the square of __G__ satisfies χ(__G__^2^) ≤ 2Δ + 25. We generalize this result to integer labelings of planar graphs involving constraints on distances one and two in the graph. © 2002

Coloring the Edges of a Complete Graph

✍ Annamaria G. Varga 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB