✦ LIBER ✦

A study of the total chromatic number of equibipartite graphs

✍ Scribed by Bor-Liang Chen; Chun-Kan Cheng; Hung-Lin Fu; Kuo-Ching Huang

Book ID: 104113953
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 587 KB
Volume: 184
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00160-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Total Chromatic Number of a Graph

✍ Vijayaditya, N. 📂 Article 📅 1971 🏛 Oxford University Press 🌐 English ⚖ 96 KB

The total chromatic number of pseudo-out

The total chromatic number of pseudo-outerplanar graphs

✍ Wang Weifan; Zhang Kemin 📂 Article 📅 1997 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 404 KB

The total chromatic number of split-indi

The total chromatic number of split-indifference graphs

✍ C.N. Campos; C.H. de Figueiredo; R. Machado; C.P. de Mello 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 202 KB

On total chromatic number of direct prod

On total chromatic number of direct product graphs

✍ Katja Prnaver; Blaž Zmazek 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 417 KB

Total chromatic number of graphs with sm

Total chromatic number of graphs with small genus

✍ Rong Luo; Cun-Quan Zhang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 338 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