A survey on not necessarily proper colorings under which certain pairs of vertices are distinguished by non-multiple color sets

zbMATH Open1449.05090MaRDI QIDQ3307706FDOQ3307706

Authors: Xiang'en Chen 

Publication date: 12 August 2020

Recommendations

• A note on graph proper total colorings with many distinguishing constraints
• Not necessarily proper total colourings which are adjacent vertex distinguishing
• General vertex-distinguishing total coloring of graphs
• Vertex-distinguishing total coloring of some split graphs
• Vertex-distinguishing total coloring of some complement double graphs

zbMATH Keywords

general edge coloringdistinguishinggeneral total coloringnon-multiple color set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

This page was built for publication: A survey on not necessarily proper colorings under which certain pairs of vertices are distinguished by non-multiple color sets

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