| The Total Chromatic Number of Graphs with an Unique Major Vertex of Degree Four |
| Received:July 11, 1995 |
| Key Words:
graph total coloring major vertex.
|
| Fund Project:Supported by the National Natural Science Foundation of China and the Doctorial Programme Foundation of State Education Commission of China. |
|
| Hits: 2037 |
| Download times: 1114 |
| Abstract: |
| The total chromatic number χT(G) of a graph G is the least number k such that G admits a total coloring with k colors. In this paper, it is proved that χT(G)=Δ(G)+1 for all graphs with an unique major vertex of degree 4. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.1998.01.006 |
| View Full Text View/Add Comment |
