Pages that link to "Item:Q2457301"
From MaRDI portal
The following pages link to Algorithms for finding distance-edge-colorings of graphs (Q2457301):
Displaying 5 items.
- On the complexity of the flow coloring problem (Q499367) (← links)
- Local algorithms for edge colorings in UDGs (Q638541) (← links)
- Distance edge-colourings and matchings (Q714033) (← links)
- On distance edge-colourings and matchings (Q2851479) (← links)
- Distance edge coloring and collision‐free communication in wireless sensor networks (Q5326804) (← links)
