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

DOI10.1016/j.disc.2019.01.024zbMath1411.05090OpenAlexW2913565887WikidataQ128391878 ScholiaQ128391878MaRDI QIDQ1732773

Xiaowei Yu, Jie Hu, Donglei Yang, Jian Liang Wu, Guang-Hui Wang

Publication date: 25 March 2019

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

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

zbMATH Keywords

planar graphmaximum degreedischarging methodadjacent vertex distinguishing total coloring

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Neighbor sum distinguishing total choosability of planar graphs
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• Every graph is \((2,3)\)-choosable
• On the neighbor sum distinguishing total coloring of planar graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Concise proofs for adjacent vertex-distinguishing total colorings
• A bound on the total chromatic number
• On the vertex-distinguishing proper edge-colorings of graphs
• The total chromatic number of any multigraph with maximum degree five is at most seven
• List edge and list total colourings of multigraphs
• Balanced edge colorings.
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• Edge weights and vertex colours
• The polynomial method and restricted sums of congruence classes
• On the AVDTC of 4-regular graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• The adjacent vertex distinguishing total coloring of planar graphs
• On the total coloring of certain graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• Vertex-distinguishing proper edge-colorings
• Vertex‐distinguishing edge colorings of random graphs
• Vertex-distinguishing edge colorings of graphs
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• On Total Chromatic Number of a Graph

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