Abstract
Given a proper total -coloring of a graph , we define the value of a vertex to be . The smallest integer such that has a proper total -coloring whose values form a proper coloring is the neighbor sum distinguishing total chromatic number of , . Pilśniak and Woźniak (2013) conjectured that for any simple graph with maximum degree . In this paper, we prove this bound to be asymptotically correct by showing that . The main idea of our argument relies on Przybyło's proof (2014) regarding neighbor sum distinguishing edge-colorings.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.