✦ LIBER ✦

The circular chromatic number of induced subgraphs

✍ Scribed by Xuding Zhu

Book ID: 108167366
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 219 KB
Volume: 92
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2004.03.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Circular chromatic number of subgraphs

✍ Hossein Hajiabolhassan; Xuding Zhu 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

## Abstract This paper proves that every (__n__ + )‐chromatic graph contains a subgraph __H__ with $\chi \_c (H) = n$. This provides an easy method for constructing sparse graphs __G__ with $\chi\_c (G) = \chi ( G) = n$. It is also proved that for any ε > 0, for any fraction __k/d__ > 2, there exis

Chromatic numbers of subgraphs

✍ F. Galvin 📂 Article 📅 1973 🏛 Springer Netherlands 🌐 English ⚖ 124 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

A bound on the chromatic number of graph

A bound on the chromatic number of graphs without certain induced subgraphs

✍ Stanley Wagon 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 144 KB

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.

The circular chromatic number of hypergr

The circular chromatic number of hypergraphs

✍ Richard C. Brewster; Gary MacGillivray; Laura Shepherd 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 556 KB