Pages that link to "Item:Q5013494"
From MaRDI portal
The following pages link to On strict strong coloring of graphs (Q5013494):
Displaying 7 items.
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- (Q3166098) (← links)
- (Q3421917) (← links)
- Strongly set-colorable graphs (Q4621304) (← links)
- Strong k-colourings of graphs (Q4809513) (← links)
- STRONG COLORINGS OVER PARTITIONS (Q5009680) (← links)