The following pages link to (Q4521553):
Displayed 6 items.
- Strong edge colouring of subcubic graphs (Q642999) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- The strong chromatic index of complete cubic Halin graphs (Q1021818) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- On the connectivity of diamond-free graphs (Q2384395) (← links)