✦ LIBER ✦

Coloring of integer distance graphs

✍ Scribed by Arnfried Kemnitz; Halka Kolberg

Book ID: 104114130
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 488 KB
Volume: 191
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00099-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance Graphs andT-Coloring

✍ Gerard J Chang; Daphne D.-F Liu; Xuding Zhu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 126 KB

We discuss relationships among T-colorings of graphs and chromatic numbers, fractional chromatic numbers, and circular chromatic numbers of distance graphs. We first prove that for any finite integral set T that contains 0, the asymptotic T-coloring ratio R(T ) is equal to the fractional chromatic n

The distance coloring of graphs

✍ Lian Ying Miao,Yi Zheng Fan 📂 Article 📅 2014 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 258 KB

Pattern Periodic Coloring of Distance Gr

Pattern Periodic Coloring of Distance Graphs

✍ Xuding Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Suppose D is a subset of Z. The distance graph G(Z, D) with distance set D is the graph with vertex set Z and two vertices x, y are adjacent if |x& y| # D. We introduce a coloring method for distance graphs, the pattern periodic coloring, and we shall compare this method with other general coloring

2-distance coloring of sparse graphs

✍ Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Distance-two coloring of sparse graphs

✍ Dvořák, Zdeněk; Esperet, Louis 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Chromatic numbers of integer distance gr

Chromatic numbers of integer distance graphs

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