✦ LIBER ✦

Some graphs with chromatic number three

✍ Scribed by Jean A Larson

Book ID: 103503793
Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 412 KB
Volume: 26
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(79)90006-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Star chromatic numbers of some planar gr

Star chromatic numbers of some planar graphs

✍ Gao, Guogang; Wang, Yiju; Zhou, Huishan 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB 👁 2 views

The concept of the star chromatic number of a graph was introduced by Vince (A. Vince, Star chromatic number, J. Graph Theory 12 (1988), 551--559), which is a natural generalization of the chromatic number of a graph. This paper calculates the star chromatic numbers of three infinite families of pla

Regular graphs with prescribed chromatic

Regular graphs with prescribed chromatic number

✍ L. Caccetta; N. J. Pullman 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract We determine the minimum number of edges in a regular connected graph on __n__ vertices, containing a complete subgraph of order __k__ ≤ __n__/2. This enables us to confirm and strengthen a conjecture of P. Erdös on the existence of regular graphs with prescribed chromatic number.

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

Graphs with Tiny Vector Chromatic Number

Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers

✍ Feige, Uriel; Langberg, Michael; Schechtman, Gideon 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 381 KB

Graphs Whose Circular Chromatic Number E

Graphs Whose Circular Chromatic Number Equals the Chromatic Number

✍ Xuding Zhu 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 206 KB

Circular chromatic numbers of some reduc

Circular chromatic numbers of some reduced Kneser graphs

✍ Ko-Wei Lih; Daphne Der-Fen Liu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB

## Abstract The vertex set of the reduced Kneser graph KG~2~(__m,2__) consists of all pairs {__a,b__} such that __a, b__ε{1,2,…,__m__} and 2≤|__a__−__b__|≤__m__−2. Two vertices are defined to be adjacent if they are disjoint. We prove that, if __m__≥4 __and m__≠5, then the circular chromatic number