On the neighbor sum distinguishing total coloring of planar graphs

DOI10.1016/J.TCS.2015.09.017zbMath1331.05084OpenAlexW1773291652MaRDI QIDQ897872

Xiaowei Yu, Cun-quan Qu, Jian Liang Wu, Guang-Hui Wang

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.017

zbMATH Keywords

planar graphtotal coloringcombinatorial nullstellensatzneighbor sum distinguishing total coloringdischarging

Mathematics Subject Classification ID

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

Related Items (29)

Neighbor sum distinguishing total chromatic number of 2-degenerate graphs ⋮ A note on the neighbor sum distinguishing total coloring of planar graphs ⋮ Neighbor sum distinguishing total coloring of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph ⋮ Neighbor sum distinguishing total coloring of 2-degenerate graphs ⋮ Total coloring of planar graphs without adjacent chordal 6-cycles ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions ⋮ Neighbor sum distinguishing total coloring of planar graphs without 4-cycles ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ 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 ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles ⋮ Neighbor sum distinguishing total coloring of triangle free IC-planar graphs ⋮ The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles ⋮ Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers ⋮ Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total choosability of IC-planar graphs ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 ⋮ 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
• Unnamed Item
• Weighted-1-antimagic graphs of prime power order
• The adjacent vertex distinguishing total chromatic number
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Irregularity strength of regular graphs
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• Edge weights and vertex colours
• The number of edge 3-colorings of a planar cubic graph as a permanent
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• The adjacent vertex distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Antimagic labelling of vertex weighted graphs
• Combinatorial Nullstellensatz
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
• Total weight choosability of graphs
• Total weight choosability of graphs

This page was built for publication: On the neighbor sum distinguishing total coloring of planar graphs