Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

DOI10.1002/jgt.21852zbMath1330.05075OpenAlexW1576706240MaRDI QIDQ3466345

Tsai-Lien Wong, Jakub Przybyło

Publication date: 1 February 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21852

zbMATH Keywords

adjacent strong chromatic indexcombinatorial nullstellensatzlist edge coloringneighbor sum distinguishing edge coloringneighbor distinguishing proper edge coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Distant set distinguishing total colourings of graphs, On generalized neighbor sum distinguishing index of planar graphs, The neighbour sum distinguishing relaxed edge colouring, Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs, Neighbor-sum-distinguishing edge choosability of subcubic graphs, List neighbor sum distinguishing edge coloring of subcubic graphs, Distant set distinguishing edge colourings of graphs, Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees, Local antimagic labeling of graphs, Neighbour sum distinguishing edge-weightings with local constraints, 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, Local antimagic orientations of \(d\)-degenerate graphs, Neighbor sum distinguishing edge coloring of subcubic graphs, Distant sum distinguishing index of graphs, Neighbor sum distinguishing index of subcubic graphs, Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz, Distant sum distinguishing index of graphs with bounded minimum degree, On the Neighbor Sum Distinguishing Index of Planar Graphs, Neighbor sum distinguishing edge colorings of sparse graphs

Cites Work

• Unnamed Item
• Neighbor sum distinguishing index
• Distant irregularity strength of 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 strong edge coloring of graphs
• Edge weights and vertex colours
• The number of edge 3-colorings of a planar cubic graph as a permanent
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• A New Upper Bound for the Irregularity Strength of Graphs
• Combinatorial Nullstellensatz
• On graph irregularity strength
• Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• Total weight choosability of graphs