Neighbor sum distinguishing index of subcubic graphs
From MaRDI portal
Publication:2014224
DOI10.1007/s00373-017-1760-0zbMath1368.05050OpenAlexW2570178293MaRDI QIDQ2014224
Jingjing Huo, Wei Fan Wang, Chuan-Dong Xu
Publication date: 10 August 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1760-0
Related Items (5)
The neighbour sum distinguishing relaxed edge colouring ⋮ Neighbor-sum-distinguishing edge choosability of subcubic graphs ⋮ List neighbor sum distinguishing edge coloring of subcubic graphs ⋮ The list \(L(2,1)\)-labeling of planar graphs with large girth ⋮ Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
Cites Work
- Neighbor sum distinguishing index
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
- \(r\)-strong edge colorings of graphs
- Adjacent strong edge coloring of graphs
- Some bounds on the neighbor-distinguishing index of 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
- A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
- Combinatorial Nullstellensatz
- 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 index of subcubic graphs
