On the Neighbor Sum Distinguishing Index of Planar Graphs

DOI10.1002/jgt.22098zbMath1367.05066arXiv1408.3190OpenAlexW3121197411MaRDI QIDQ4978296

Jakub Przybyło, Marthe Bonamy

Publication date: 8 August 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.3190

zbMATH Keywords

adjacent strong chromatic index1-2-3 conjecturedischarging methodneighbor sum distinguishing index

Mathematics Subject Classification ID

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

Related Items (26)

The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 ⋮ Neighbor sum distinguishing total chromatic number of 2-degenerate graphs ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ On generalized neighbor sum distinguishing index of planar graphs ⋮ 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 ⋮ Distant set distinguishing edge colourings of graphs ⋮ Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture ⋮ Adjacent vertex distinguishing colorings by sum of sparse graphs ⋮ 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 ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ Neighbor sum distinguishing edge colorings of sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• Neighbor sum distinguishing index
• Distant irregularity strength of graphs
• Neighbor sum distinguishing index of planar graphs
• An improved upper bound for the neighbor sum distinguishing index of graphs
• \(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
• On vertex-coloring 13-edge-weighting
• Adjacent strong edge coloring of graphs
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• Neighbour-distinguishing edge colourings of random regular graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• How to Define an Irregular Graph
• A New Upper Bound for the Irregularity Strength of Graphs
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
• Irregular Assignments of Trees and Forests
• Combinatorial Nullstellensatz
• On the irregularity strength of trees
• A Tight Bound on the Irregularity Strength of Graphs
• On graph irregularity strength
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
• On the Irregularity Strength of Dense Graphs
• Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• On Neighbor-Distinguishing Index of Planar Graphs
• Irregularity strength of dense graphs

This page was built for publication: On the Neighbor Sum Distinguishing Index of Planar Graphs