The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)

DOI10.1007/s10878-016-9995-xzbMath1376.05052OpenAlexW2267231731MaRDI QIDQ2410091

Xiaohan Cheng, Jian Liang Wu, Guang-Hui Wang

Publication date: 17 October 2017

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

Full work available at URL: https://doi.org/10.1007/s10878-016-9995-x

zbMATH Keywords

planar graphmaximum degreeadjacent 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 (11)

Adjacent vertex distinguishing total coloring in split graphs ⋮ On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) ⋮ 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 ⋮ The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) ⋮ Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve ⋮ Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten ⋮ Neighbor sum distinguishing total colorings of corona of subcubic graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs

Cites Work

• Unnamed Item
• 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 adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• Planar graphs of maximum degree seven are Class I
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• The adjacent vertex distinguishing total coloring of planar graphs
• 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 adjacent-vertex-distinguishing total coloring of graphs
• Combinatorial Nullstellensatz
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree

This page was built for publication: The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)