Some bounds on the neighbor-distinguishing index of graphs
From MaRDI portal
Publication:2352066
DOI10.1016/j.disc.2015.05.007zbMath1314.05082OpenAlexW640218892MaRDI QIDQ2352066
Jingjing Huo, Yi Qiao Wang, Wei Fan Wang
Publication date: 29 June 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.05.007
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (15)
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs ⋮ Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time ⋮ A general framework for analysing the mortality experience of a large portfolio of lives: with an application to the UK universities superannuation scheme ⋮ Strict neighbor-distinguishing index of subcubic graphs ⋮ Edge-partitions of graphs and their neighbor-distinguishing index ⋮ Two-distance vertex-distinguishing index of sparse subcubic graphs ⋮ Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs ⋮ Local neighbor-distinguishing index of graphs ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs ⋮ Unnamed Item ⋮ Neighbor sum distinguishing index of subcubic graphs ⋮ 2-distance vertex-distinguishing index of subcubic graphs ⋮ On the neighbor-distinguishing indices of planar graphs
Cites Work
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
- On the neighbour-distinguishing index of a graph
- \(r\)-strong edge colorings of graphs
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Adjacent strong edge coloring of graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
This page was built for publication: Some bounds on the neighbor-distinguishing index of graphs
