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
Cites work
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- r-strong edge colorings of graphs
- Adjacent strong edge coloring of graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- Graph theory with applications
- scientific article; zbMATH DE number 16247 (Why is no real title available?)
- On the neighbour-distinguishing index of a graph
Cited in
(55)- 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
- An improved upper bound on neighbor expanded sum distinguishing index
- 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
- A note on adjacent vertex distinguishing colorings of graphs
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Neighbor sum distinguishing index of a kind of sparse graphs
- Neighbor sum distinguishing coloring of some graphs
- On the neighbor sum distinguishing index of planar graphs
- Neighbor sum distinguishing edge coloring of the join of paths
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- On generalized neighbor sum distinguishing index of planar graphs
- Neighbor sum distinguishing edge coloring of the lexicographic product of paths
- Progress on the adjacent vertex distinguishing edge coloring conjecture
- Distant sum distinguishing index of graphs with bounded minimum degree
- Neighbor sum distinguishing edge coloring of subcubic graphs
- The neighbour-sum-distinguishing edge-colouring game
- -neighborhood chromatic index of a graph
- On the neighbor sum-distinguishing vertex coloring of a graph
- 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
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- Neighbor sum distinguishing index of K₄-minor free graphs
- Neighbor sum distinguishable k-edge colorings of joint graphs
- Adjacent vertex distinguishing total coloring of corona product of graphs
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- Quasi-majority neighbor sum distinguishing edge-colorings
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
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)
