Pages that link to "Item:Q5229341"
From MaRDI portal
The following pages link to Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number (Q5229341):
Displaying 8 items.
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (Q832991) (← links)
- Pattern avoidance on graphs (Q878624) (← links)
- Inclusion total chromatic number (Q2037565) (← links)
- (Q3384719) (← links)
- Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture (Q5138970) (← links)
- On the inclusion chromatic index of a graph (Q6055925) (← links)
- Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) (← links)