Neighbor sum distinguishing total colorings of planar graphs

DOI10.1007/S10878-013-9660-6zbMath1325.05083OpenAlexW1967183009MaRDI QIDQ498443

Hualong Li, Bingqiang Liu, Guang-Hui Wang, Lai-hao Ding

Publication date: 28 September 2015

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

Full work available at URL: https://doi.org/10.1007/s10878-013-9660-6

zbMATH Keywords

planar graphmaximum degreeneighbor sum 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 (47)

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Neighbor sum distinguishing total chromatic number of 2-degenerate graphs ⋮ A note on the neighbor sum distinguishing total coloring of planar graphs ⋮ Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles ⋮ Neighbor sum distinguishing total choosability 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 (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ Neighbor sum distinguishing total coloring of 2-degenerate graphs ⋮ Total coloring of planar graphs without adjacent chordal 6-cycles ⋮ The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) ⋮ 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 ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs ⋮ Total colorings of \(F_5\)-free planar graphs with maximum degree 8 ⋮ Local antimagic labeling of 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 coloring and list neighbor sum distinguishing total coloring ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ Distant total sum distinguishing index of graphs ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles ⋮ Neighbor sum distinguishing list total coloring of subcubic graphs ⋮ Neighbor sum distinguishing total coloring of triangle free IC-planar graphs ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers ⋮ Neighbor sum distinguishing total choice number of planar graphs without 6-cycles ⋮ Neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Neighbor sum distinguishing total coloring of graphs with bounded treewidth ⋮ Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total choosability of IC-planar graphs ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ 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 ⋮ Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\) ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Weighted-1-antimagic graphs of prime power order
• 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
• Concise proofs for adjacent vertex-distinguishing total colorings
• Edge weights and vertex colours
• 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
• Antimagic labelling of vertex weighted graphs
• 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: Neighbor sum distinguishing total colorings of planar graphs