✦ LIBER ✦

Local optimization of colorings of graphs

✍ Scribed by A. V. Anisimov

Publisher: Springer US
Year: 1987
Tongue: English
Weight: 855 KB
Volume: 22
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized local colorings of graphs

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

A note on local colorings of graphs

✍ Andrzej Ruciński; Miroslaw Truszczyński 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Recently, R6dl and Rucifiski [5,6] proved the following threshold result about Ramsey properties of random graphs. Let K(n, p) be the binomial random graph obtained from the complete graph K(n) by independent deletion of each edge with probability 1 -p. We write F ~ (G)r if for every r-coloring of t

T-colorings of graphs

✍ Daphne Der-Fen Liu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 594 KB

Given a finite set T of positive integers containing {0}, a T-coloring of a simple graph G is a nonnegative integer function f defined on the vertex set of G, such that if (u, v} E E(G) then Lf(u) -f (u)l $ T. The T-span of a T-coloring is defined as the difference of the largest and smallest colors

Iterated colorings of graphs

✍ Sandra M Hedetniemi; Stephen T Hedetniemi; Alice A McRae; Dee Parks; Jan Arne Te 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 786 KB

Relative colorings of graphs

✍ Paul C Kainen 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 231 KB

Consecutive colorings of graphs

✍ D. de Werra; A. Hertz 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 262 KB