The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven

DOI10.1007/s10878-017-0149-6zbMath1386.05036OpenAlexW2732132030MaRDI QIDQ1698052

Xiaohan Cheng, Jian Liang Wu

Publication date: 21 February 2018

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

Full work available at URL: https://doi.org/10.1007/s10878-017-0149-6

zbMATH Keywords

planar graphmaximum degreeadjacent vertex distinguishing total choosability

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 (6)

Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Optimal \(r\)-dynamic coloring of sparse graphs ⋮ Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten ⋮ Bounds on neighborhood total domination number in 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 without 4-cycles
• 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
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• 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
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The total chromatic number of any multigraph with maximum degree five is at most seven
• 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 chromatic numbers of planar graphs with \(\Delta=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 adjacent-vertex-distinguishing total coloring of graphs
• On total 9-coloring planar graphs of maximum degree seven
• Combinatorial Nullstellensatz

This page was built for publication: The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven