Pages that link to "Item:Q3174728"
From MaRDI portal
The following pages link to On the Fine-Grained Complexity of Rainbow Coloring (Q3174728):
Displaying 11 items.
- On finding rainbow and colorful paths (Q266284) (← links)
- The algorithmic complexity of colour switching (Q1199936) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← links)
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- Quadratic vertex kernel for rainbow matching (Q2300725) (← links)
- On the complexity of \(k\)-rainbow cycle colouring problems (Q2422742) (← links)
- Inapproximability of Rainbow Colouring (Q2963907) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
- A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability (Q6616225) (← links)