An improved upper bound for the neighbor sum distinguishing index of graphs
From MaRDI portal
Publication:401154
DOI10.1016/J.DAM.2014.05.013zbMATH Open1297.05093OpenAlexW2075663003MaRDI QIDQ401154FDOQ401154
Publication date: 26 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.013
Recommendations
- Neighbor sum distinguishing index
- A note on asymptotically optimal neighbour sum distinguishing colourings
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
Cites Work
- Graph theory
- Adjacent strong edge coloring of graphs
- Neighbor sum distinguishing index
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent Vertex Distinguishing Edge‐Colorings
- \(r\)-strong edge colorings of graphs
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- On the neighbour-distinguishing index of a graph
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
Cited In (25)
- 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
- Neighbor sum distinguishing index of subcubic graphs
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs
- Neighbor sum distinguishing index of sparse graphs
- Neighbor sum distinguishing index of planar graphs
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- Injective coloring of some graph operations
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- On the Neighbor Sum Distinguishing Index of Planar Graphs
- Neighbor-sum-distinguishing edge choosability of subcubic graphs
- Improving upper bounds for the distinguishing index
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Some bounds on the neighbor-distinguishing index of graphs
- List neighbor sum distinguishing edge coloring of subcubic graphs
- Neighbour sum distinguishing edge-weightings with local constraints
- The neighbour sum distinguishing relaxed edge colouring
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
- Neighbor sum distinguishing edge coloring of subcubic graphs
This page was built for publication: An improved upper bound for the neighbor sum distinguishing index of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401154)
