Neighbor sum distinguishing index of sparse graphs
From MaRDI portal
Publication:2194737
DOI10.1007/S10114-020-9027-8zbMath1441.05086OpenAlexW3034576732MaRDI QIDQ2194737
Bao Jian Qiu, Ji Hui Wang, Jian-Sheng Cai
Publication date: 7 September 2020
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-020-9027-8
combinatorial nullstellensatzmaximum average degreeproper edge coloringneighbor sum distinguishing edge coloring
Coloring of graphs and hypergraphs (05C15) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Unnamed Item
- Neighbor sum distinguishing total choosability of planar graphs
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Neighbor sum distinguishing index
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Neighbor sum distinguishing total colorings of planar graphs
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- On the neighbour-distinguishing index of a graph
- \(r\)-strong edge colorings of graphs
- On the neighbor sum distinguishing total coloring of planar graphs
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Adjacent strong edge coloring of graphs
- Neighbor sum distinguishing edge colorings of sparse graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Combinatorial Nullstellensatz
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
- On the Neighbor Sum Distinguishing Index of Planar Graphs
- On Neighbor-Distinguishing Index of Planar Graphs
This page was built for publication: Neighbor sum distinguishing index of sparse graphs
