Pages that link to "Item:Q5116492"
From MaRDI portal
The following pages link to Tight Lower Bounds for List Edge Coloring (Q5116492):
Displaying 7 items.
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree (Q3010389) (← links)
- Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs (Q3559384) (← links)
- Near-optimal list colorings (Q4521554) (← links)
- Lower bounds for monotonic list labeling (Q5056101) (← links)
- Efficiently list-edge coloring multigraphs asymptotically optimally (Q5146931) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)