A note on graph proper total colorings with many distinguishing constraints

DOI10.1016/J.IPL.2015.11.014zbMath1357.05048OpenAlexW2187822623MaRDI QIDQ264189

Bing Yao, Chao Yang, Han Ren

Publication date: 6 April 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.11.014

zbMATH Keywords

edge-coloringtotal coloringvertex distinguishing coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Some results on spanning trees
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• On equitable vertex distinguishing edge colorings of trees
• On adjacent-vertex-distinguishing total coloring of graphs
• Vertex-distinguishing proper edge-colorings

This page was built for publication: A note on graph proper total colorings with many distinguishing constraints