Not necessarily proper total colourings which are adjacent vertex distinguishing

DOI10.1080/00207160.2013.786829zbMath1280.05039OpenAlexW2074801803MaRDI QIDQ2874310

Bing Yao, Xiang'en Chen, Yu-ping Gao

Publication date: 29 January 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2013.786829

zbMATH Keywords

total colouringadjacent vertex distinguishing proper edge chromatic numberadjacent vertex distinguishing not necessarily proper total chromatic numberadjacent vertex distinguishing not necessarily proper total colouringadjacent vertex distinguishing proper edge colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Recent results on the total chromatic number
• \(r\)-strong edge colorings of graphs
• A new type of edge-derived vertex coloring
• Adjacent strong edge coloring of graphs
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• Total colourings of graphs
• General neighbour-distinguishing index of a graph
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• On adjacent-vertex-distinguishing total coloring of graphs
• On the adjacent vertex distinguishing edge colourings of graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY

This page was built for publication: Not necessarily proper total colourings which are adjacent vertex distinguishing