✦ LIBER ✦

A new color change to improve the coloring of a graph

✍ Scribed by C. Berge

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 115 KB
Volume: 24
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90268-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast parallel algorithm to color a gra

A fast parallel algorithm to color a graph with Δ colors

✍ Mauricio Karchmer; Joseph Naor 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 502 KB

A reduction of propositional tautologiho

A reduction of propositional tautologihood to the coloring of graphs in three colors

✍ G. V. Davydov; P. Yu. Suvorov 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 287 KB

The color space of a graph

✍ Tommy R. Jensen; Carsten Thomassen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 1 views

Note on a new coloring number of a graph

✍ P. Horák; J. Širáň 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB 👁 1 views

## Abstract The distance coloring number __X__~__d__~(__G__) of a graph __G__ is the minimum number __n__ such that every vertex of __G__ can be assigned a natural number __m__ ≤ __n__ and no two vertices at distance __i__ are both assigned __i__. It is proved that for any natural number __n__ ther

Color Chain of a Graph

✍ R. Balakrishnan; T. Kavaskar 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 259 KB

Relaxed Coloring of a Graph

✍ Sunanda Bagchi 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 82 KB