Name
Abstract | ||
|---|---|---|
The total chromatic number χτ ( G ) of a graph G is the least number of colors needed to color the vertices and the edges of G such that no adjacent or incident pair of elements receive the same color. A simple graph G is called type 1 if χτ ( G ) = Δ ( G ) + 1, where Δ ( G ) is the maximum degree of G . In this paper we prove the following conjecture of Chen et al.: An ( n − 2)-regular equibipartite graph K n , n − E ( J ) is type 1 if and only if J contains a 4-cycle. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S0012-365X(98)00118-6 | Discrete Mathematics |
Keywords | Field | DocType |
total coloring,total colorings,equibipartite graph,latin square,maximum degree | Edge coloring,Discrete mathematics,Combinatorics,Graph toughness,Total coloring,Fractional coloring,Bound graph,Graph power,Degree (graph theory),Brooks' theorem,Mathematics | Journal |
Volume | Issue | ISSN |
194 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bor-Liang Chen | 1 | 143 | 20.64 |
| Lei Dong | 2 | 0 | 1.35 |
| Qizhang Liu | 3 | 12 | 2.54 |
| Kuo-Chig Huang | 4 | 0 | 0.34 |