✦ LIBER ✦

Distance graphs with large chromatic numbers and small clique numbers

✍ Scribed by A. B. Kupavskii, A. M. Raigorodskii

Book ID: 114993294
Publisher: SP MAIK Nauka/Interperiodica
Year: 2012
Tongue: English
Weight: 232 KB
Volume: 85
Category: Article
ISSN: 1064-5624
DOI: 10.1134/s1064562412030295

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance graphs with large chromatic num

Distance graphs with large chromatic number and without large cliques

✍ A. M. Raigorodskii; O. I. Rubanov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 631 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__

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 structure of distance graphs with

On the structure of distance graphs with large chromatic numbers

✍ A. M. Raigorodskii 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 383 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

Dense graphs with small clique number

✍ Wayne Goddard; Jeremy Lyle 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB