Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree

DOI10.1016/J.DAM.2013.10.009zbMath1283.05090OpenAlexW2001221074MaRDI QIDQ2636830

Aijun Dong, Jiang-Hua Zhang, Guang-Hui Wang

Publication date: 18 February 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.009

zbMATH Keywords

proper coloringsmaximum average degreeneighbor sum distinguishing edge colorings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (20)

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 ⋮ The neighbour sum distinguishing relaxed edge colouring ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles ⋮ Neighbor sum distinguishing index of 2-degenerate graphs ⋮ Neighbor sum distinguishing index of planar graphs ⋮ List neighbor sum distinguishing edge coloring of subcubic graphs ⋮ An improved upper bound for the neighbor sum distinguishing index of graphs ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ 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}\) ⋮ Distant sum distinguishing index of graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with small 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
• Neighbor sum distinguishing index
• Neighbor sum distinguishing index of planar graphs
• An improved upper bound for the neighbor sum distinguishing index of graphs
• 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
• On vertex-coloring 13-edge-weighting
• Adjacent strong edge coloring of graphs
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree