Neighbor sum distinguishing index of \(K_4\)-minor free graphs
From MaRDI portal
Publication:2631098
DOI10.1007/s00373-015-1655-xzbMath1342.05053OpenAlexW2261415383MaRDI QIDQ2631098
Shan Zhou, Jiang-Hua Zhang, Lai-hao Ding, Gui Ying Yan, Guang-Hui Wang
Publication date: 28 July 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1655-x
Cites Work
- Unnamed Item
- 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 edge colorings of \(K_{4}\)-minor free 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 vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- On vertex-coloring 13-edge-weighting
- Adjacent strong edge coloring of graphs
- Edge weights and vertex colours
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
- On the Neighbor Sum Distinguishing Index of Planar Graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
