Neighbor sum distinguishing index
From MaRDI portal
Publication:367074
DOI10.1007/S00373-012-1191-XzbMath1272.05047OpenAlexW2113910803MaRDI 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 indexneighbor sum distinguishing coloringneighbor-distinguishing indexproper edge coloring
Related Items (42)
A note on adjacent vertex distinguishing colorings of graphs ⋮ The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 ⋮ Asymptotically optimal neighbor sum distinguishing total colorings of graphs ⋮ 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 ⋮ 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 ⋮ Complexity of the improper twin edge coloring of 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 ⋮ 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 ⋮ An improved upper bound for the neighbor sum distinguishing index 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 ⋮ Distant total sum distinguishing index of graphs ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ A note on face coloring entire weightings of plane graphs ⋮ Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture ⋮ Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree ⋮ 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 ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ 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 ⋮ On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs ⋮ On the total-neighbor-distinguishing index by sums ⋮ Neighbor sum distinguishing edge colorings of sparse graphs
Cites Work
This page was built for publication: Neighbor sum distinguishing index
