Neighbor sum distinguishing total colorings of planar graphs

Hualong Li, Laihao Ding, Bingqiang Liu and Guanghui Wang ()
Additional contact information
Hualong Li: Shandong University
Laihao Ding: Shandong University
Bingqiang Liu: Shandong University
Guanghui Wang: Shandong University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 3, No 17, 675-688

Abstract: Abstract A total [k]-coloring of a graph $$G$$ G is a mapping $$\phi : V (G) \cup E(G)\rightarrow [k]=\{1, 2,\ldots , k\}$$ ϕ : V ( G ) ∪ E ( G ) → [ k ] = { 1 , 2 , … , k } such that any two adjacent or incident elements in $$V (G) \cup E(G)$$ V ( G ) ∪ E ( G ) receive different colors. Let $$f(v)$$ f ( v ) denote the sum of the color of a vertex $$v$$ v and the colors of all incident edges of $$v$$ v . A total $$[k]$$ [ k ] -neighbor sum distinguishing-coloring of $$G$$ G is a total $$[k]$$ [ k ] -coloring of $$G$$ G such that for each edge $$uv\in E(G)$$ u v ∈ E ( G ) , $$f(u)\ne f(v)$$ f ( u ) ≠ f ( v ) . By $$\chi ^{''}_{nsd}(G)$$ χ n s d ′ ′ ( G ) , we denote the smallest value $$k$$ k in such a coloring of $$G$$ G . Pilśniak and Woźniak conjectured $$\chi _{nsd}^{''}(G)\le \Delta (G)+3$$ χ n s d ′ ′ ( G ) ≤ Δ ( G ) + 3 for any simple graph with maximum degree $$\Delta (G)$$ Δ ( G ) . In this paper, we prove that this conjecture holds for any planar graph with maximum degree at least 13.

Keywords: Neighbor sum distinguishing total coloring; Planar graph; Maximum degree (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9660-6 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:30:y:2015:i:3:d:10.1007_s10878-013-9660-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9660-6

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 ().