The rainbow connection of a graph is (at most) reciprocal to its minimum degree.
Michael KrivelevichRaphael YusterPublished in: J. Graph Theory (2010)
Keyphrases
- spanning tree
- connected dominating set
- random graphs
- graph model
- directed graph
- edge disjoint
- random walk
- graph theoretic
- bipartite graph
- graph theory
- graph representation
- connected components
- undirected graph
- minimum spanning tree
- graphical representation
- graph structure
- graph matching
- structured data
- graph partitioning
- minimum cost
- graph mining
- directed acyclic graph
- weighted graph
- graph search
- minimum cut
- dominating set
- square error
- genetic algorithm