Pages that link to "Item:Q2376940"
From MaRDI portal
The following pages link to On the strong rainbow connection of a graph (Q2376940):
Displaying 14 items.
- Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study (Q262974) (← links)
- The \((k,\ell)\)-rainbow index of random graphs (Q263013) (← links)
- On rainbow total-coloring of a graph (Q494442) (← links)
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number (Q1656916) (← links)
- Proper connection number of graph products (Q1714046) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← links)
- Distance-local rainbow connection number (Q2158184) (← links)
- On the rainbow vertex-connection (Q2860860) (← links)
- (Q4986553) (← links)
- Rainbow and strong rainbow connection number for some families of graphs (Q5145917) (← links)
- (Q5206408) (← links)
- On various (strong) rainbow connection numbers of graphs (Q5374232) (← links)
- (Strong) rainbow connection number of three classes of graphs (Q5382437) (← links)