𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partition Relations Connected with the Chromatic Number of Graphs

✍ Scribed by Erdos, P.; Rado, R.

Book ID
120099868
Publisher
Oxford University Press
Year
1959
Tongue
English
Weight
241 KB
Volume
s1-34
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cyclic Chromatic Number of 3-Connected P
Cyclic Chromatic Number of 3-Connected Plane Graphs
✍ Enomoto, Hikoe; HornΓ‘k, Mirko; Jendrol', Stanislav πŸ“‚ Article πŸ“… 2001 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 200 KB
Total chromatic number of complete r-par
Total chromatic number of complete r-partite graphs
✍ K. H. Chew; H. P. Yap πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 284 KB πŸ‘ 1 views

## Abstract Rosenfeld (1971) proved that the Total Colouring Conjecture holds for balanced complete __r__‐partite graphs. Bermond (1974) determined the exact total chromatic number of every balanced complete __r__‐partite graph. Rosenfeld's result had been generalized recently to complete __r__‐par

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 chromatic connectivity of graphs
The chromatic connectivity of graphs
✍ C. D. Godsil; R. Nowakowski; J. NeΕ‘etΕ™il πŸ“‚ Article πŸ“… 1988 πŸ› Springer Japan 🌐 English βš– 291 KB