✦ LIBER ✦

On chromatic uniqueness of certain 5-partite graphs

✍ Scribed by H. Roslan; A. S. Ameen; Y. H. Peng; H. X. Zhao

Book ID: 107620011
Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 316 KB
Volume: 35
Category: Article
ISSN: 1598-5865
DOI: 10.1007/s12190-009-0374-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic uniqueness of certain complete

Chromatic uniqueness of certain complete tripartite graphs

✍ G. C. Lau; Y. H. Peng 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 194 KB

On T-chromatic uniqueness of graphs

✍ Zhi-Yi Guo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 335 KB

A note on chromatic uniqueness of graphs

✍ G. L. Chia 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 122 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

Classification of complete 5-partite gra

Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with 5nvertices

✍ Haixing Zhao; Ruying Liu; Shenggui Zhang 📂 Article 📅 2004 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 421 KB

On path-chromatically unique graphs

✍ Esperanza Blancaflor Arugay; Severino Villanueva Gervacio 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 230 KB

The least number of colors needed to color the vertices of a graph G such that the vertices in each color class induces a linear forest is called the path-chromatic number of G, denoted by Zoo (G). If all such colorings of the vertices of G induce the same partitioning of the vertices of G, we say