Pages that link to "Item:Q3087941"
From MaRDI portal
The following pages link to On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms (Q3087941):
Displayed 5 items.
- Rainbow connections for outerplanar graphs with diameter 2 and 3 (Q279540) (← links)
- On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215) (← links)
- On rainbow total-coloring of a graph (Q494442) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)