Name
Abstract | ||
|---|---|---|
The neighbor-distinguishing total chromatic number $$\chi ''_{a}(G)$$ of a graph G is the minimum number of colors required for a proper total coloring of G such that any two adjacent vertices have different sets of colors. In this paper, we show that if G is a planar graph with $$\Delta =12$$, then $$13\le \chi ''_{a}(G)\le 14$$, and moreover $$\chi ''_{a}(G)=14$$ if and only if G contains two adjacent 12-vertices. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10878-019-00465-3 | Journal of Combinatorial Optimization |
Keywords | Field | DocType |
Planar graph, Neighbor-distinguishing total coloring, Discharging, Combinatorial Nullstellensatz, 05C15 | Graph,Combinatorics,Total coloring,Vertex (geometry),Chromatic scale,Degree (graph theory),Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
39 | 1 | 1382-6905 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jingjing Huo | 1 | 0 | 0.34 |
| Yiqiao Wang | 2 | 0 | 0.34 |
| Weifan Wang | 3 | 868 | 89.92 |
| Wenjing Xia | 4 | 0 | 0.34 |