Rainbow k-connection in dense graphs
From MaRDI portal
Recommendations
Cited in
(20)- On total rainbow \(k\)-connected graphs
- Rainbow \(k\)-connectivity of random bipartite graphs
- Rainbow monochromatic \(k\)-edge-connection colorings of graphs
- Rainbow and monochromatic vertex-connection of random graphs
- Rainbow vertex \(k\)-connection in graphs
- Rainbow connection for some families of hypergraphs
- Concentration of rainbow \(k\)-connectivity of a multiplex random graph
- Rainbow connection number of dense graphs
- Rainbow k-connection in dense graphs (extended abstract)
- Note on the rainbow k-connectivity of regular complete bipartite graphs.
- The rainbow connectivity of a graph
- The rainbow k-connectivity of two classes of graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Total rainbow \(k\)-connection in graphs
- On rainbow-k-connectivity of random graphs
- On k-rainbow connection in graphs
- The size of graphs with restricted rainbow 2-connection number
- (1, 2)-rainbow connection number at most 3 in connected dense graphs
- Rainbow connection for complete multipartite graphs
- Rainbow paths
This page was built for publication: Rainbow \(k\)-connection in dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500302)