|
|||||
|
|
A sufficient condition for bipartite graphs to be type one |
|
| Authors: | Baogang Xu |
| Abstract: | The total chromatic number χT(G) of graph G is the least number of colors assigned to V(G) ∪ E(G) such that no adjacent or incident elements receive the same color. In this article, we give a sufficient condition for a bipartite graph G to have χT(G) = Δ(G) + 1. © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 133–137, 1998 |
| Keywords: | total-coloring bipartite graph major vertex |