Neighbor sum distinguishing index
From MaRDI portal
Publication:367074
DOI10.1007/S00373-012-1191-XzbMATH Open1272.05047OpenAlexW2113910803MaRDI QIDQ367074FDOQ367074
Authors: Evelyne Flandrin, Antoni Marczyk, Jakub Przybyło, Jean-François Saclé, Mariusz Woźniak 
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
Recommendations
- A note on neighbor expanded sum distinguishing index
- Neighbor sum distinguishing index of sparse graphs
- On the total-neighbor-distinguishing index by sums
- Neighbor sum distinguishing index of a kind of sparse graphs
- Neighbor sum distinguishing index of planar graphs
- Neighbor sum distinguishing index of subcubic graphs
- An improved upper bound on neighbor expanded sum distinguishing index
- Local neighbor-distinguishing index of graphs
- Neighbor sum distinguishing index of 2-degenerate graphs
- Distant sum distinguishing index of graphs
chromatic indexneighbor sum distinguishing coloringneighbor-distinguishing indexproper edge coloring
Cites Work
- Adjacent strong edge coloring of graphs
- Graph theory with applications
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent Vertex Distinguishing Edge‐Colorings
- \(r\)-strong edge colorings of graphs
- Title not available (Why is that?)
- On the neighbour-distinguishing index of a graph
Cited In (51)
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs
- A note on face coloring entire weightings of plane graphs
- On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs
- Asymptotically optimal neighbor sum distinguishing total colorings of 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
- Distant sum distinguishing index of graphs with bounded minimum degree
- Neighbor sum distinguishing edge coloring of the join of paths
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing index of sparse graphs
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- An improved upper bound on neighbor expanded sum distinguishing index
- A note on asymptotically optimal neighbour sum distinguishing colourings
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- \(\delta\)-neighborhood chromatic index of a graph
- 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 coloring of some graphs
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
- Neighbor sum distinguishing index of a kind of sparse graphs
- On the total-neighbor-distinguishing index by sums
- Neighbor-sum-distinguishing edge choosability of subcubic graphs
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing edge coloring of the lexicographic product of paths
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- List neighbor sum distinguishing edge coloring of subcubic graphs
- On the neighbor sum-distinguishing vertex coloring of a graph
- Neighbour sum distinguishing edge-weightings with local constraints
- On generalized neighbor sum distinguishing index of planar graphs
- The neighbour sum distinguishing relaxed edge colouring
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- Complexity of the improper twin edge coloring of 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
- Distant total sum distinguishing index of graphs
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
- Distant set distinguishing total colourings of graphs
- Neighbor sum distinguishing edge coloring of subcubic graphs
- The neighbour-sum-distinguishing edge-colouring game
This page was built for publication: Neighbor sum distinguishing index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367074)
