Pages that link to "Item:Q908308"
From MaRDI portal
The following pages link to Further hardness results on rainbow and strong rainbow connectivity (Q908308):
Displaying 8 items.
- On finding rainbow and colorful paths (Q266284) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- Algorithm on rainbow connection for maximal outerplanar graphs (Q517025) (← links)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- Rainbow connectivity of Moore cages of girth 6 (Q1801053) (← links)
- On the complexity of \(k\)-rainbow cycle colouring problems (Q2422742) (← links)
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
- A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)
