Name
Abstract | ||
|---|---|---|
A total coloring of a graph G is a coloring such that no two adjacent or incident elements receive the same color. In this field there is a famous conjecture, named Total Coloring Conjecture, saying that the the total chromatic number of each graph G is at most $$\\Delta +2$$Δ+2. Let G be a planar graph with maximum degree $$\\Delta \\ge 7$$Δź7 and without adjacent chordal 6-cycles, that is, two cycles of length 6 with chord do not share common edges. In this paper, it is proved that the total chromatic number of G is $$\\Delta +1$$Δ+1, which partly confirmed Total Coloring Conjecture. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10878-016-0063-3 | J. Comb. Optim. |
Keywords | Field | DocType |
Planar graph,Total coloring,Cycle | Complete coloring,Discrete mathematics,Edge coloring,Total coloring,Combinatorics,Graph power,Fractional coloring,List coloring,Brooks' theorem,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
34 | 1 | 1382-6905 |
Citations | PageRank | References |
0 | 0.34 | 16 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hui-Juan Wang | 1 | 43 | 10.27 |
| Bin Liu | 2 | 88 | 11.12 |
| Xiaoli Wang | 3 | 67 | 22.94 |
| Guangmo Tong | 4 | 71 | 10.47 |
| Weili Wu | 5 | 2093 | 170.29 |
| Hongwei Gao | 6 | 34 | 16.41 |