Name
Abstract | ||
|---|---|---|
AbstractThe neighbor-distinguishing total coloring of a graph G is a proper total coloring of G using k colors such that any two adjacent vertices have different sets of colors. It was known that every planar graph G with $$\Delta \ge 10$$Δ?10 is neighbor-distinguishing totally $$(\Delta +3)$$(Δ+3)-colorable. In this paper, we extend this result to the case $$\Delta =9$$Δ=9. Namely, we prove that every planar graph G with $$\Delta =9$$Δ=9 is neighbor-distinguishing totally 12-colorable. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s10878-018-0334-2 | Periodicals |
Keywords | DocType | Volume |
Planar graph,Neighbor-distinguishing total coloring,Maximum degree,Combinatorial Nullstellensatz,Discharging | Journal | 37 |
Issue | ISSN | Citations |
3 | 1382-6905 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weifan Wang | 1 | 868 | 89.92 |
| Jingjing Huo | 2 | 7 | 3.06 |
| Danjun Huang | 3 | 77 | 9.89 |
| Yiqiao Wang | 4 | 494 | 42.81 |