The general neighbor-distinguishing total coloring of graphs

zbMATH Open1224.05198MaRDI QIDQ3073345FDOQ3073345

Authors: Qiantai Yan 

Publication date: 5 February 2011

Recommendations

• A note on general neighbor-distinguishing total coloring of graphs.
• On adjacent-vertex-distinguishing total coloring of graphs
• The general neighbor-distinguishing chromatic index of graphs
• On the adjacent spectral radius of cycles with fixed weight sets
• General vertex-distinguishing total coloring of graphs

zbMATH Keywords

general neighbor-distinguishing total colouringgeneral neighbor-distinguishing total colouring chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (12)

• Title not available (Why is that?)
• The general neighbor-distinguishing edge coloring of strong products and compositions of graphs
• General neighbour-distinguishing indices on some classes of operation graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Neighbor-distinguishing vertex colorings of graphs
• A note on general neighbor-distinguishing total coloring of graphs.
• On the adjacent spectral radius of cycles with fixed weight sets
• The general neighbor-distinguishing chromatic index of graphs
• Open neighbourhood colouring of some path related graphs
• Title not available (Why is that?)
• The neighbor expanded sum distinguishing total colorings of three types of join graphs of wheel and fan

This page was built for publication: The general neighbor-distinguishing total coloring of graphs

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