Planar graphs with $$\Delta =9$$Δ=9 are neighbor-distinguishing totally 12-colorable
Weifan Wang,
Jingjing Huo,
Danjun Huang and
Yiqiao Wang ()
Additional contact information
Weifan Wang: Zhejiang Normal University
Jingjing Huo: Hebei University of Engineering
Danjun Huang: Zhejiang Normal University
Yiqiao Wang: Beijing University of Chinese Medicine
Journal of Combinatorial Optimization, 2019, vol. 37, issue 3, No 16, 1089 pages
Abstract:
Abstract The 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.
Keywords: Planar graph; Neighbor-distinguishing total coloring; Maximum degree; Combinatorial Nullstellensatz; Discharging; 05C15 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0334-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:3:d:10.1007_s10878-018-0334-2
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-018-0334-2
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().