𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The chromatic number of ℝnwith a set of forbidden distances

✍ Scribed by A. B. Kupavskii

Book ID
111455256
Publisher
SP MAIK Nauka/Interperiodica
Year
2010
Tongue
English
Weight
219 KB
Volume
82
Category
Article
ISSN
1064-5624

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic number of ℝ9
On the chromatic number of ℝ9
✍ A. B. Kupavskii; A. M. Raigorodskii 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 165 KB
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

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