Neighbor-sum-distinguishing edge choosability of subcubic graphs

DOI10.1007/S10878-016-0104-YzbMath1376.05057OpenAlexW2561462004MaRDI QIDQ1680485

Jingjing Huo, Yi Qiao Wang, Wei Fan Wang

Publication date: 16 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0104-y

zbMATH Keywords

combinatorial nullstellensatzsubcubic graphmaximum average degreelist neighbor-sum-distinguishing edge coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Neighbour sum distinguishing edge-weightings with local constraints

Cites Work

• 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 graphs with smaller maximum average degree
• Neighbor sum distinguishing index of subcubic graphs
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
• Combinatorial Nullstellensatz
• On the Neighbor Sum Distinguishing Index of Planar Graphs

This page was built for publication: Neighbor-sum-distinguishing edge choosability of subcubic graphs