Pages that link to "Item:Q5111276"
From MaRDI portal
The following pages link to Fine-Grained Complexity of Rainbow Coloring and its Variants. (Q5111276):
Displaying 5 items.
- The algorithmic complexity of colour switching (Q1199936) (← links)
- On the complexity of \(k\)-rainbow cycle colouring problems (Q2422742) (← links)
- Inapproximability of Rainbow Colouring (Q2963907) (← links)
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)