Adjacent vertex distinguishing colorings by sum of sparse graphs

DOI10.1016/J.DISC.2015.07.011zbMath1322.05086OpenAlexW1182716290MaRDI QIDQ501028

Xiaowei Yu, Yi Qiao Wang, Cun-quan Qu, Guang-Hui Wang

Publication date: 8 October 2015

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

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

zbMATH Keywords

combinatorial nullstellensatzmaximum average degreeproper edge coloringneighbor sum distinguishing edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Related Items (8)

The neighbour sum distinguishing relaxed edge colouring ⋮ 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 ⋮ Neighbor sum distinguishing edge coloring of subcubic graphs

Cites Work

• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• Neighbor sum distinguishing index
• Neighbor sum distinguishing index of planar graphs
• An improved upper bound for the neighbor sum distinguishing index of 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
• Edge weights and vertex colours
• \(\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
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Combinatorial Nullstellensatz
• On the Neighbor Sum Distinguishing Index of Planar Graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• Unnamed Item
• Unnamed Item

This page was built for publication: Adjacent vertex distinguishing colorings by sum of sparse graphs