On the adjacent-vertex-strongly-distinguishing total coloring of graphs

DOI10.1007/S11425-007-0128-YzbMath1149.05019OpenAlexW2255720106MaRDI QIDQ931507

Bing Yao, Hui Cheng, Xiang'en Chen, Bao-Gen Xu, Jing-wen Li, Zhong Fu Zhang

Publication date: 25 June 2008

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-007-0128-y

zbMATH Keywords

proper coloringadjacent-vertex-strongly-distinguishing total coloringavsdt coloringsimple connected graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Improved bounds on linear coloring of plane graphs ⋮ Adjacent strong edge colorings and total colorings of regular graphs

Cites Work

• Strong edge colorings of graphs
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• On adjacent-vertex-distinguishing total coloring of graphs
• Vertex-distinguishing proper edge-colorings
• Unnamed Item

This page was built for publication: On the adjacent-vertex-strongly-distinguishing total coloring of graphs