On total chromatic number of direct product graphs
✍ Scribed by Katja Prnaver; Blaž Zmazek
- Book ID
- 107619938
- Publisher
- Springer-Verlag
- Year
- 2009
- Tongue
- English
- Weight
- 417 KB
- Volume
- 33
- Category
- Article
- ISSN
- 1598-5865
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## 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
Let G be a planar graph. The vertex face total chromatic number ,y13(G) of G is the least number of colors assigned to V(G) U F(G) such that no adjacent or incident elements receive the same color. The main results of this paper are as follows: (1) We give the vertex face total chromatic number for