Total chromatic number of one kind of join graphs
β Scribed by Guangrong Li; Limin Zhang
- Book ID
- 108113659
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 223 KB
- Volume
- 306
- Category
- Article
- ISSN
- 0012-365X
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