Neighbor sum distinguishing edge coloring of subcubic graphs
DOI10.1007/S10114-017-5516-9zbMATH Open1359.05050OpenAlexW2567995771MaRDI QIDQ523715FDOQ523715
Authors: Xiaowei Yu, Jian-Liang Wu, Guanghui Wang, Guiying 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
Recommendations
- Neighbor sum distinguishing index of subcubic graphs
- Neighbor-sum-distinguishing edge choosability of subcubic graphs
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- Neighbor sum distinguishing index of sparse graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
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)
Cites Work
- Adjacent strong edge coloring of graphs
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
- Graph theory with applications
- Neighbor sum distinguishing index
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Combinatorial Nullstellensatz
- Neighbor sum distinguishing coloring of some graphs
- Neighbor sum distinguishing total colorings of planar graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- On the neighbor sum distinguishing index of planar graphs
- Adjacent vertex distinguishing colorings by sum of sparse graphs
Cited In (10)
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- Neighbor sum distinguishing index of subcubic graphs
- Neighbor sum distinguishing edge colorings of sparse graphs
- Proper edge-colorings with a rich neighbor requirement
- Equitable neighbour-sum-distinguishing edge and total colourings
- Neighbor-sum-distinguishing edge choosability of subcubic graphs
- List neighbor sum distinguishing edge coloring of subcubic graphs
- On the chromatic number of a family of odd hole free graphs
- The neighbour sum distinguishing relaxed edge colouring
- Title not available (Why is that?)
This page was built for publication: Neighbor sum distinguishing edge coloring of subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q523715)
