Neighbor sum distinguishing edge coloring of subcubic graphs
From MaRDI portal
Publication:523715
DOI10.1007/S10114-017-5516-9zbMath1359.05050OpenAlexW2567995771MaRDI QIDQ523715
Xiaowei Yu, Jian Liang Wu, Guang-Hui Wang, Gui Ying Yan
Publication date: 21 April 2017
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-017-5516-9
planar graphsubcubic graphmaximum average degreeproper edge coloringneighbor sum distinguishing edge coloring
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
The neighbour sum distinguishing relaxed edge colouring ⋮ List neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
Cites Work
- Unnamed Item
- 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 strong edge coloring of graphs
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- 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
- On Neighbor-Distinguishing Index of Planar Graphs
This page was built for publication: Neighbor sum distinguishing edge coloring of subcubic graphs
