Neighbor sum distinguishing edge colorings of sparse graphs

DOI10.1016/J.DAM.2015.04.018zbMath1316.05045OpenAlexW261688557MaRDI QIDQ2355754

Yaojun Chen, Xiaolan Hu, Rong Luo, Zheng-Ke Miao

Publication date: 24 July 2015

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

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

zbMATH Keywords

maximum degreemaximum average degreeneighbor sum distinguishing edge coloringsproper edge colorings

Mathematics Subject Classification ID

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

Related Items (9)

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 index of 2-degenerate graphs ⋮ List neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)

Cites Work

• Neighbor sum distinguishing index
• Neighbor sum distinguishing index of planar 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
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent strong edge coloring of 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
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
• On the Neighbor Sum Distinguishing Index of Planar Graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• On Neighbor-Distinguishing Index of Planar Graphs

This page was built for publication: Neighbor sum distinguishing edge colorings of sparse graphs