Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
DOI10.1007/S10255-018-0731-4zbMath1383.05125OpenAlexW2793152102WikidataQ130186102 ScholiaQ130186102MaRDI QIDQ1709430
Xiaowei Yu, Yu-ping Gao, Lai-hao Ding
Publication date: 5 April 2018
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-018-0731-4
combinatorial Nullstellensatzmaximum average degreeproper edge coloringneighbor sum distinguishing edge coloring
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Density (toughness, etc.) (05C42)
Cites Work
- Unnamed Item
- 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
- Adjacent vertex distinguishing colorings by sum of sparse 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
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
- Combinatorial Nullstellensatz
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
- On the Neighbor Sum Distinguishing Index of Planar Graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
This page was built for publication: Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
