Upper bounds for adjacent vertex-distinguishing edge coloring
From MaRDI portal
Publication:1702826
DOI10.1007/s10878-017-0187-0zbMath1392.05046OpenAlexW2761186239MaRDI QIDQ1702826
Yun Dai, Junlei Zhu, Yuehua Bu
Publication date: 1 March 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0187-0
Related Items
Optimal \(r\)-dynamic coloring of sparse graphs, Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
Cites Work
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\)
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
- Adjacent vertex distinguishing colorings by sum of sparse 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
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Strong edge colorings of graphs
- Adjacent strong edge coloring of graphs
- Some bounds on the neighbor-distinguishing index of graphs
- Edge-partitions of graphs and their neighbor-distinguishing index
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Vertex-distinguishing proper edge-colorings
- On the Neighbor Sum Distinguishing Index of Planar Graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
