Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
From MaRDI portal
Publication:681756
DOI10.1007/s10114-017-6491-xzbMath1385.05033OpenAlexW2706919875MaRDI QIDQ681756
Ji Hui Wang, Bao Jian Qiu, Yan Liu
Publication date: 13 February 2018
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-017-6491-x
proper coloringscombinatorial Nullstellensatzmaximum average degreeneighbor sum distinguishing coloring
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- 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
- Neighbor sum distinguishing edge coloring of subcubic graphs
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
- 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
- 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
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
- 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
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
This page was built for publication: Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
