Commun. Korean Math. Soc. 2015; 30(1): 45-64
Printed January 31, 2015
https://doi.org/10.4134/CKMS.2015.30.1.45
Copyright © The Korean Mathematical Society.
Hana Choi, Dongseok Kim, Sungjin Lee, and Yeonhee Lee
Sungkyunkwan University, Kyonggi University, Yonsei University, Kyonggi University
In this article, we consider a proper total coloring distinguishes adjacent vertices by sums, if every two adjacent vertices have different total sum of colors of the edges incident to the vertex and the color of the vertex. Pilsniak and Wozniak~\cite{PW} first introduced this coloring and made a conjecture that the minimal number of colors need to have a proper total coloring distinguishes adjacent vertices by sums is less than or equal to the maximum degree plus $3$. We study proper total colorings distinguishing adjacent vertices by sums of some graphs and their products. We prove that these graphs satisfy the conjecture.
Keywords: coloring, total coloring, proper coloring distinguishing adjacent vertices by sum
MSC numbers: 05C15
2023; 38(3): 913-924
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd