✦ LIBER ✦

On the structure of distance graphs with large chromatic numbers

✍ Scribed by A. M. Raigorodskii

Publisher: SP MAIK Nauka/Interperiodica
Year: 2006
Tongue: English
Weight: 383 KB
Volume: 80
Category: Article
ISSN: 0001-4346
DOI: 10.1007/s11006-006-0161-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On embedding of finite distance graphs w

On embedding of finite distance graphs with large chromatic number in random graphs

✍ S. V. Nagaeva; A. M. Raigorodskii 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 293 KB

Fractional chromatic number and circular

Fractional chromatic number and circular chromatic number for distance graphs with large clique size

✍ Daphne Der-Fen Liu; Xuding Zhu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract An Erratum has been published for this article in Journal of Graph Theory 48: 329–330, 2005. Let __M__ be a set of positive integers. The distance graph generated by __M__, denoted by __G__(__Z, M__), has the set __Z__ of all integers as the vertex set, and edges __ij__ whenever |__i__

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 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 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 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