A note on graph proper total colorings with many distinguishing constraints

DOI10.1016/J.IPL.2015.11.014zbMATH Open1357.05048OpenAlexW2187822623MaRDI QIDQ264189FDOQ264189

Authors Bing Yao, Han Ren, Chao Yang 

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)

Recommendations

• Vertex-distinguishing total coloring of some complement double graphs
• Vertex-distinguishing proper edge-colorings
• scientific article; zbMATH DE number 6010672
• A note on the vertex-distinguishing proper edge coloring of graphs.
• General vertex-distinguishing total coloring of graphs

Cites work

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

Cited in

(4)

• scientific article; zbMATH DE number 6010672 (Why is no real title available?)
• A note on neighbor expanded sum distinguishing index
• A survey on not necessarily proper colorings under which certain pairs of vertices are distinguished by non-multiple color sets
• Distinguishing graphs by total colourings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264189)