✦ LIBER ✦

Chromatic number of prime distance graphs

✍ Scribed by M. Voigt; H. Walther

Book ID: 104183154
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 619 KB
Volume: 51
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90109-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Chromatic numbers of integer distance gr

Chromatic numbers of integer distance graphs

✍ Arnfried Kemnitz; Massimiliano Marangio 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 105 KB

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

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

Circular chromatic number of distance gr

Circular chromatic number of distance graphs with distance sets of cardinality 3

✍ Xuding Zhu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

## Abstract Suppose __D__ is a subset of __R__^+^. The distance graph __G__(__R, D__) is the graph with vertex set __R__ in which two vertices __x__,__y__ are adjacent if |__x__−__y__| ∈ __D__. This study investigates the circular chromatic number and the fractional chromatic number of distance gra