𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the chromatic forcing number of a random graph

✍ Scribed by Colin McDiarmid

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
549 KB
Volume
5
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the chromatic number of a random 5-re
On the chromatic number of a random 5-regular graph
✍ J. DΓ­az; A. C. Kaporis; G. D. Kemkes; L. M. Kirousis; X. PΓ©rez; N. Wormald πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 275 KB πŸ‘ 1 views

## Abstract It was only recently shown by Shi and Wormald, using the differential equation method to analyze an appropriate algorithm, that a random 5‐regular graph asymptotically almost surely has chromatic number at most 4. Here, we show that the chromatic number of a random 5‐regular graph is as

On the harmonious chromatic number of a
On the harmonious chromatic number of a graph
✍ John Mitchem πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 755 KB

The harmonious chromatic number of a graph G, denoted by h(G), is the least number of colon which can be assigned to the vertices of G such that adjacent vertices are colored differently and any two distinct edges have different color pairs. This is a slight variation of a definition given independe

A bound on the chromatic number of a gra
A bound on the chromatic number of a graph
✍ Paul A. Catlin πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 392 KB

We give an upper bound on the chromatic number of a graph in terms of its maximum degree and the size of the largest complete subgraph. Our result extends a theorem due to i3rook.s.