Neighbor sum distinguishing index
From MaRDI portal
Publication:367074
DOI10.1007/s00373-012-1191-xzbMath1272.05047MaRDI QIDQ367074
Jean-François Saclé, Antoni Marczyk, Evelyne Flandrin, Mariusz Woźniak, Jakub Przybyło
Publication date: 26 September 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1191-x
chromatic index; neighbor sum distinguishing coloring; neighbor-distinguishing index; proper edge coloring
05C15: Coloring of graphs and hypergraphs
Related Items
On the Neighbor Sum Distinguishing Index of Planar Graphs, On generalized neighbor sum distinguishing index of planar graphs, Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture, Distant sum distinguishing index of graphs with bounded minimum degree, Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz, Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees, Neighbour sum distinguishing edge-weightings with local constraints, A note on adjacent vertex distinguishing colorings of graphs, Neighbor sum distinguishing index of planar graphs, An improved upper bound for the neighbor sum distinguishing index of graphs, Adjacent vertex distinguishing colorings by sum of sparse graphs, Neighbor sum distinguishing edge coloring of subcubic graphs, Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\), Neighbor sum distinguishing edge colorings of graphs with small maximum average degree, The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11, Neighbor-sum-distinguishing edge choosability of subcubic graphs, Neighbor sum distinguishing index of 2-degenerate graphs, List neighbor sum distinguishing edge coloring of subcubic graphs, Distant set distinguishing edge colourings of 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, Distant total sum distinguishing index of graphs, A note on asymptotically optimal neighbour sum distinguishing colourings, Distant sum distinguishing index of graphs, Neighbor sum distinguishing index of subcubic graphs, On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs, Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs, Neighbor sum distinguishing index of sparse graphs, Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24, On the total-neighbor-distinguishing index by sums, Neighbor sum distinguishing edge colorings of sparse graphs, Asymptotically optimal neighbor sum distinguishing total colorings of graphs, Complexity of the improper twin edge coloring of graphs, A note on face coloring entire weightings of plane graphs, Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree, Distant set distinguishing total colourings of graphs, Neighbor sum distinguishing index of \(K_4\)-minor free graphs, Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree, The neighbour sum distinguishing relaxed edge colouring, Asymptotically optimal neighbour sum distinguishing colourings of graphs, Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
Cites Work
