✦ LIBER ✦

The coloring of graphs in a linear number of steps

✍ Scribed by A. A. Kalnin'sh

Publisher: Springer US
Year: 1974
Tongue: English
Weight: 830 KB
Volume: 7
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Game Coloring Number of Planar Graph

The Game Coloring Number of Planar Graphs

✍ Xuding Zhu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 121 KB

This paper discusses a variation of the game chromatic number of a graph: the game coloring number. This parameter provides an upper bound for the game chromatic number of a graph. We show that the game coloring number of a planar graph is at most 19. This implies that the game chromatic number of a

A linear 5-coloring algorithm of planar

A linear 5-coloring algorithm of planar graphs

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 526 KB

Partition graphs and coloring numbers of

Partition graphs and coloring numbers of a graph

✍ E. Sampathkumar; V.N. Bhave 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 288 KB

A Linear Heterochromatic Number of Graph

A Linear Heterochromatic Number of Graphs

✍ J.J. Montellano-Ballesteros; V. Neumann-Lara 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 239 KB

The number of incomplete colorings of th

The number of incomplete colorings of the vertices of a graph

✍ Kh. N. Narzullaev 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 135 KB

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