An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
From MaRDI portal
Publication:741759
DOI10.1016/j.dam.2013.08.038zbMath1300.05112arXiv1208.2315OpenAlexW2101259320MaRDI QIDQ741759
Ko-Wei Lih, Lian Zhu Zhang, Wei Fan Wang
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.2315
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items
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 ⋮ Neighbor sum distinguishing index of subcubic graphs ⋮ The algorithm for adjacent vertex distinguishing proper edge coloring of graphs ⋮ Some bounds on the neighbor-distinguishing index of graphs ⋮ On the neighbor-distinguishing indices of planar graphs
Cites Work
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Vertex-distinguishing edge colorings of graphs with degree sum conditions
- 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
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- On the vertex-distinguishing proper edge-colorings of graphs
- Balanced edge colorings.
- Adjacent strong edge coloring of graphs
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Vertex-distinguishing proper edge-colorings
- Vertex‐distinguishing edge colorings of random graphs
- Vertex-distinguishing edge colorings of graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
- Unnamed Item
- Unnamed Item
- Unnamed Item
