The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles

DOI10.1007/s10878-016-0004-1zbMath1359.05046OpenAlexW2335742916MaRDI QIDQ511730

Lin Sun, Xiaohan Cheng, Jian Liang Wu

Publication date: 22 February 2017

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

Full work available at URL: https://doi.org/10.1007/s10878-016-0004-1

zbMATH Keywords

planar graphcombinatorial Nullstellensatzdischarging methodadjacent vertex distinguishing total coloring

Mathematics Subject Classification ID

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

Related Items (2)

The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten

Cites Work

• Unnamed Item
• Neighbor sum distinguishing index of planar graphs
• An improved upper bound for the neighbor sum distinguishing index of graphs
• Weighted-1-antimagic graphs of prime power order
• The adjacent vertex distinguishing total chromatic number
• Additive coloring 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 coloring of graphs with lower average degree
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Irregularity strength of regular 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
• The adjacent vertex distinguishing total coloring of planar graphs
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On adjacent-vertex-distinguishing total coloring of graphs
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• Antimagic labelling of vertex weighted graphs
• Combinatorial Nullstellensatz
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Total weight choosability of graphs
• Total weight choosability of graphs

This page was built for publication: The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles