Pages that link to "Item:Q2857388"
From MaRDI portal
The following pages link to Bounds and complexity results for strong edge colouring of subcubic graphs (Q2857388):
Displaying 7 items.
- Strong edge colouring of subcubic graphs (Q642999) (← links)
- On the hardness of computing span of subcubic graphs (Q888955) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- The NP-completeness of (1,r)-subcolorability of cubic graphs (Q1603517) (← links)
- On the algorithmic aspects of strong subcoloring (Q1752633) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- On strong edge-colouring of subcubic graphs (Q2444538) (← links)