Pages that link to "Item:Q2294720"
From MaRDI portal
The following pages link to Algorithms and bounds for very strong rainbow coloring (Q2294720):
Displaying 6 items.
- Inapproximability of Rainbow Colouring (Q2963907) (← links)
- Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes (Q5089235) (← links)
- Template-driven rainbow coloring of proper interval graphs (Q5896886) (← links)
- Template-driven rainbow coloring of proper interval graphs (Q5925620) (← links)
- An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs (Q6065850) (← links)
- Algorithms and Bounds for Very Strong Rainbow Coloring (Q6283756) (← links)