✦ LIBER ✦

Chromatic numbers of subgraphs

✍ Scribed by F. Galvin

Publisher: Springer Netherlands
Year: 1973
Tongue: English
Weight: 124 KB
Volume: 4
Category: Article
ISSN: 0031-5303
DOI: 10.1007/bf02276099

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

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.

On the chromatic number of a graph with

On the chromatic number of a graph with two forbidden subgraphs

✍ Medha Dhurandhar 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Finite subgraphs of uncountably chromati

Finite subgraphs of uncountably chromatic graphs

✍ Péter Komjáth; Saharon Shelah 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract It is consistent that for every function __f__:ω → ω there is a graph with size and chromatic number ℵ~1~ in which every __n__‐chromatic subgraph contains at least __f__(__n__) vertices (__n__ ≥ 3). This solves a $ 250 problem of Erdős. It is consistent that there is a graph __X__ with

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

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