On adjacent-vertex-distinguishing total coloring of graphs

By Zhongfu Zhang, Xiangen Chen, Jingwen Li, B. Yao, Xinzhong Lu, Jianfang Wang. 2005

164 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/3afe3c35976400374ddc5b5ee5f90bbd39e01182

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Guanghui Wang
2. Aijun Dong
3. Jianghua Zhang

Citations in the corpus

• Neighbor sum distinguishing total colorings of K4-minor free graphs (2013, unknown): “Conjecture 2 [15] If G is a graph, then χ′′ nd(G) Δ(G) + 3.”
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree (2014, background): “introduced the notion of neighbor vertex distinguishing k-total coloring and brought forward the following conjecture (see [19]).”