𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The hunting of a snark with total chromatic number 5

✍ Scribed by Sasaki, D.; Dantas, S.; de Figueiredo, C.M.H.; Preissmann, M.

Book ID
122704828
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
825 KB
Volume
164
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on the total chromatic number of
A note on the total chromatic number of Halin graphs with maximum degree 4
✍ Zhongfu Zhang; Linzhong Liu; Jianfang Wang; Hongxiang Li πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 210 KB

In this paper, we prove that XT(G) = 5 for any Halin graph G with A(G) = 4, where A(G) and XT(G) denote the maximal degree and the total chromatic number of G, respectively.

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