Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10

DOI10.1007/s10878-018-00375-wzbMath1420.05052MaRDI QIDQ2424800

Guang-Hui Wang, Yu-Lin Chang, Qiancheng Ouyang

Publication date: 25 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-00375-w

zbMATH Keywords

planar graph; combinatorial Nullstellensatz; adjacent vertex distinguishing total coloring; discharging

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