Upper bounds on adjacent vertex distinguishing total chromatic number of graphs

DOI10.1016/j.dam.2017.08.016zbMath1372.05073MaRDI QIDQ2410247

Yunqing Zhang, Xiaolan Hu, Zheng-Ke Miao

Publication date: 17 October 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.08.016

zbMATH Keywords

chromatic number; maximum degree; adjacent vertex distinguishing total coloring; edge chromatic number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C07: Vertex degrees