On the neighbour sum distinguishing index of graphs with bounded maximum average degree

DOI10.1007/s00373-017-1822-3zbMath1380.05064arXiv1508.06112OpenAlexW3157431921MaRDI QIDQ1696532

Jakub Przybyło, Hervé Hocquard

Publication date: 14 February 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

neighbour sum distinguishing indexdischarging methodmaximum average degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

The neighbour sum distinguishing relaxed edge colouring ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• Neighbor sum distinguishing index
• An improved upper bound for the neighbor sum distinguishing index of graphs
• Adjacent vertex distinguishing colorings by sum of sparse graphs
• Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
• 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
• Neighbor sum distinguishing edge colorings of sparse graphs
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• \(\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
• 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
• A Tight Bound on the Irregularity Strength of Graphs
• On graph irregularity strength
• On the Neighbor Sum Distinguishing Index of Planar Graphs
• On the Irregularity Strength of Dense 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 neighbour sum distinguishing index of graphs with bounded maximum average degree