𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Every rayless graph has an unfriendly partition

✍ Scribed by Henning Bruhn; Reinhard Diestel; Agelos Georgakopoulos; Philipp Sprüssel

Book ID
106167776
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
206 KB
Volume
30
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Every 4-Colorable Graph With Maximum Deg
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
✍ H. A. Kierstead; A. V. Kostochka 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB

## Abstract Chen et al., conjectured that for __r__≥3, the only connected graphs with maximum degree at most __r__ that are not equitably __r__‐colorable are __K__~__r, r__~ (for odd __r__) and __K__~__r__ + 1~. If true, this would be a joint strengthening of the Hajnal–Szemerédi theorem and Brooks