Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz

DOI10.1137/120880586zbMATH Open1290.05079OpenAlexW2031399476MaRDI QIDQ2870508FDOQ2870508

Authors: 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

Recommendations

• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
• Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz

zbMATH Keywords

list edge coloringcombinatorial Nullstellensatzadjacent strong chromatic indexneighbor-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)

Cited In (41)

• Neighbour-distinguishing edge colourings of random regular graphs
• A note on adjacent vertex distinguishing colorings of graphs
• Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
• The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
• Neighbor sum distinguishing index of \(K_4\)-minor free graphs
• On the neighbor sum distinguishing index of planar graphs
• Neighbor sum distinguishing index of 2-degenerate graphs
• Progress on the adjacent vertex distinguishing edge coloring conjecture
• Distant sum distinguishing index of graphs
• Neighbor sum distinguishing index of subcubic graphs
• An improved upper bound for neighbor sum distinguishing edge colorings of graphs
• Distant sum distinguishing index of graphs with bounded minimum degree
• Neighbor sum distinguishing edge colorings of sparse graphs
• Neighbor sum distinguishing index of sparse graphs
• Neighbor sum distinguishing index of planar graphs
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• A note on asymptotically optimal neighbour sum distinguishing colourings
• Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
• Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Distant set distinguishing edge colourings of graphs
• Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
• Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
• Title not available (Why is that?)
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor-sum-distinguishing edge choosability of subcubic graphs
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• List neighbor sum distinguishing edge coloring of subcubic graphs
• Multi-set neighbor distinguishing 3-edge coloring
• Neighbour sum distinguishing edge-weightings with local constraints
• On generalized neighbor sum distinguishing index of planar graphs
• The neighbour sum distinguishing relaxed edge colouring
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Adjacent vertex distinguishing colorings by sum of sparse graphs
• On the neighbour sum distinguishing index of graphs with bounded maximum average degree
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
• Distant set distinguishing total colourings of graphs
• Neighbor sum distinguishing edge coloring of subcubic graphs

This page was built for publication: Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870508)