✦ LIBER ✦

Chromatic numbers of integer distance graphs

✍ Scribed by Arnfried Kemnitz; Massimiliano Marangio

Book ID: 108315541
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 105 KB
Volume: 233
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00243-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The chromatic numbers of distance graphs

✍ Walter A. Deuber; Xuding Zhu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 777 KB

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

Chromatic number of prime distance graph

Chromatic number of prime distance graphs

✍ M. Voigt; H. Walther 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 619 KB

Distance Graphs with Finite Chromatic Nu

Distance Graphs with Finite Chromatic Number

✍ I.Z. Ruzsa; Zs. Tuza; M. Voigt 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 96 KB

The distance graph G(D) with distance set D={d 1 , d 2 , ...} has the set Z of integers as vertex set, with two vertices i, j ¥ Z adjacent if and only if |i -j| ¥ D. We prove that the chromatic number of G(D) is finite whenever inf{d i+1 /d i } > 1 and that every growth speed smaller than this admit

Circular Chromatic Numbers of Distance G

Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples

✍ Lingling Huang; Gerard J Chang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 114 KB

Given positive integers m, k, s with m > sk, let D m,k,s represent the set {1, 2, . . . , m}\{k, 2k, . . . , sk}. The distance graph G(Z , D m,k,s ) has as vertex set all integers Z and edges connecting i and j whenever |i -j| ∈ D m,k,s . This paper investigates chromatic numbers and circular chroma

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