𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The chromatic numbers of distance graphs

✍ Scribed by Walter A. Deuber; Xuding Zhu

Book ID
108316073
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
777 KB
Volume
165-166
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the chromatic number of special dista
On the chromatic number of special distance graphs
✍ M. Voigt; H. Walther πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 153 KB

## A b&act Voigt, M. and H. Walther, On the chromatic number of special distance graphs, Discrete Mathematics 97 (1991) 395-397. For all 12 10 and u 2 1' -61+ 3 the chromatic number is proved to be 3 for distance graphs with all integers as vertices, and edges only if the vertices are at distance

On the d-distance face chromatic number
On the d-distance face chromatic number of plane graphs
✍ Mirko HorňÑk; Stanislav Jendrol' πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 223 KB

The d-distance face chromatic number of a connected plane graph G is the minimum number of colours in such a colouring of faces of G that whenever two distinct faces are at the distance at most d, they receive distinct colours. We estimate the d-distance face chromatic number from above for connecte

Circular Chromatic Numbers and Fractiona
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs
✍ G.J. Chang; L. Huang; X. Zhu πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for