Pages that link to "Item:Q1702826"
From MaRDI portal
The following pages link to Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826):
Displaying 7 items.
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759) (← links)
- A Vizing-like theorem for union vertex-distinguishing edge coloring (Q2410224) (← links)
- Optimal \(r\)-dynamic coloring of sparse graphs (Q2424825) (← links)
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number (Q2573644) (← links)
- (Q3640332) (← links)
- Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number (Q5229341) (← links)
- Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) (← links)