Pages that link to "Item:Q832991"
From MaRDI portal
The following pages link to The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (Q832991):
Displaying 6 items.
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five (Q489739) (← links)
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052) (← links)
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
- Neighbor-distinguishing indices of planar graphs with maximum degree ten (Q2686132) (← 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)