List neighbor sum distinguishing edge coloring of subcubic graphs

DOI10.1016/J.DISC.2017.09.023zbMath1376.05058OpenAlexW2765519426MaRDI QIDQ1686014

Peng Zhang

Publication date: 20 December 2017

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

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

zbMATH Keywords

subcubic graphcombinatorial Nullstellensatzlist neighbor sum distinguishing edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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
• Neighbor sum distinguishing edge coloring of subcubic graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Neighbor sum distinguishing index of 2-degenerate graphs
• Edge weights and vertex colours
• Neighbor sum distinguishing index of subcubic graphs
• Neighbor sum distinguishing edge colorings of sparse graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• Bounding the weight choosability number of a graph
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• On the Neighbor Sum Distinguishing Index of Planar Graphs
• A structure theorem for graphs with no cycle with a unique chord and its consequences

This page was built for publication: List neighbor sum distinguishing edge coloring of subcubic graphs