Neighbor sum distinguishing index of 2-degenerate graphs
From MaRDI portal
Publication:1680491
DOI10.1007/S10878-017-0110-8zbMath1376.05056OpenAlexW2571844969MaRDI QIDQ1680491
Xiaolan Hu, Yaojun Chen, Rong Luo, Zheng-Ke Miao
Publication date: 16 November 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0110-8
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (3)
List neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring ⋮ Neighbor sum distinguishing list total coloring of subcubic graphs
Cites Work
- Neighbor sum distinguishing index
- Neighbor sum distinguishing index of planar graphs
- On the neighbour-distinguishing index of a graph
- \(r\)-strong edge colorings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Adjacent strong edge coloring of graphs
- Edge weights and vertex colours
- 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
- Acyclic edge coloring of 2-degenerate graphs
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
- Strong Chromatic Index of 2-Degenerate Graphs
- On the Neighbor Sum Distinguishing Index of Planar Graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
- Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
This page was built for publication: Neighbor sum distinguishing index of 2-degenerate graphs
