Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz

DOI10.1137/120880586zbMath1290.05079OpenAlexW2031399476MaRDI QIDQ2870508

Jakub Przybyło

Publication date: 21 January 2014

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

Full work available at URL: https://doi.org/10.1137/120880586

zbMATH Keywords

adjacent strong chromatic indexlist edge coloringcombinatorial Nullstellensatzneighbor-distinguishing proper edge coloringneighbor-sum-distinguishing edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (37)

A note on adjacent vertex distinguishing colorings of graphs ⋮ Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz ⋮ The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 ⋮ Distant set distinguishing total colourings of graphs ⋮ Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree ⋮ Asymptotically optimal neighbour sum distinguishing colourings of graphs ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ On generalized neighbor sum distinguishing index of planar graphs ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ 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 ⋮ Neighbor sum distinguishing index of 2-degenerate graphs ⋮ Neighbor sum distinguishing index of planar 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 ⋮ Neighbour sum distinguishing edge-weightings with local constraints ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture ⋮ Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Adjacent vertex distinguishing colorings by sum of sparse graphs ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ 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

This page was built for publication: Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz