Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8

DOI10.1016/J.DISC.2020.112014zbMath1445.05037OpenAlexW3032928471MaRDI QIDQ785813

Xiaowei Yu, Jie Hu, Yu-Lin Chang, Guang-Hui Wang

Publication date: 12 August 2020

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112014

zbMATH Keywords

planar graphcombinatorial Nullstellensatzadjacent vertex distinguishing total coloringdischarging

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (3)

Adjacent vertex distinguishing total coloring in split graphs ⋮ A note on additive choice number of planar graphs ⋮ Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree

Cites Work

• Unnamed Item
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Neighbor sum distinguishing total choosability of planar graphs
• The adjacent vertex distinguishing total chromatic number
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• The total chromatic number of any multigraph with maximum degree five is at most seven
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
• The polynomial method and restricted sums of congruence classes
• Colorings of plane graphs: a survey
• On the AVDTC of 4-regular graphs
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• On the total coloring of certain graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• On total 9-coloring planar graphs of maximum degree seven
• Combinatorial Nullstellensatz
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• On Total Chromatic Number of a Graph
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz

This page was built for publication: Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8