Neighbor sum distinguishing index of planar graphs

DOI10.1016/J.DISC.2014.06.027zbMath1298.05136OpenAlexW2161246626MaRDI QIDQ396740

Zhumin Chen, Ji Hui Wang, Guang-Hui Wang

Publication date: 14 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.027

zbMATH Keywords

planar graphadjacent vertex distinguishing coloringneighbor sum distinguishing index

Mathematics Subject Classification ID

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

Related Items (25)

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 ⋮ 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 edge colorings of graphs with bounded maximum average degree ⋮ On generalized neighbor sum distinguishing index of planar graphs ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Neighbor-sum-distinguishing edge choosability of subcubic graphs ⋮ Neighbor sum distinguishing index of 2-degenerate graphs ⋮ List neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Adjacent vertex distinguishing colorings by sum of sparse graphs ⋮ The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ Neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Distant sum distinguishing index of graphs ⋮ Neighbor sum distinguishing index of subcubic graphs ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ Neighbor sum distinguishing edge colorings of sparse graphs

Cites Work

• Unnamed Item
• Neighbor sum distinguishing index
• An improved upper bound for the neighbor sum distinguishing index of graphs
• Weighted-1-antimagic graphs of prime power order
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• On the neighbour-distinguishing index of a graph
• \(r\)-strong edge colorings of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Irregularity strength of regular graphs
• Adjacent strong edge coloring of graphs
• An improved bound on acyclic chromatic index of planar graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• Antimagic labelling of vertex weighted graphs
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
• Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• Total weight choosability of graphs
• Total weight choosability of graphs

This page was built for publication: Neighbor sum distinguishing index of planar graphs