✦ LIBER ✦

Chromaticity of a family of 5-partite graphs

✍ Scribed by Hasni, R.; Shaman, A.; Lau, G.C.

Book ID: 121982432
Publisher: Informa UK (Taylor & Francis)
Year: 2014
Tongue: English
Weight: 504 KB
Volume: 15
Category: Article
ISSN: 1815-3852
DOI: 10.1016/j.jaubas.2013.05.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 chromatic uniqueness of certain 5-par

On chromatic uniqueness of certain 5-partite graphs

✍ H. Roslan; A. S. Ameen; Y. H. Peng; H. X. Zhao 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 316 KB

Chromaticity of complete 6-partite graph

Chromaticity of complete 6-partite graphs with certain star or matching deleted II

✍ Roslan Hasni, Ameen Shaman Ameen, Yee-Hock Peng, Hai-xing Zhao 📂 Article 📅 2013 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 213 KB

Another family of chromatically unique g

Another family of chromatically unique graphs

✍ Yee-Hock Peng 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 368 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

Chromaticity of triangulated graphs

✍ Paul Vaderlind 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

A graph G is called triangulated (or rigid-circuit graph, or chordal graph) if every circuit of G with length greater than 3 has a chord. It can be shown (see, UI, . . . , u,, . Let G = G,.