𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance graphs with large chromatic number and without large cliques

✍ Scribed by A. M. Raigorodskii; O. I. Rubanov

Book ID
110149703
Publisher
SP MAIK Nauka/Interperiodica
Year
2010
Tongue
English
Weight
631 KB
Volume
87
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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__

Subgraphs of large connectivity and chro
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number
✍ N. Alon; D. Kleitman; C. Thomassen; M. Saks; P. Seymour πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 144 KB

For each pair k, rn of natural numbers there exists a natural number f(k, rn) such that every f ( k , m)-chromatic graph contains a k-connected subgraph of chromatic number at least rn.