Rainbow k-connection in Dense Graphs (Extended Abstract)

  title={Rainbow k-connection in Dense Graphs (Extended Abstract)},
  author={Shinya Fujita and Henry Liu and Colton Magnant},
  journal={Electronic Notes in Discrete Mathematics},
An edge-colouring of a graph G is rainbow k-connected if, for any two vertices of G, there are k internally vertex-disjoint paths joining them, each of which is rainbow (i.e., all edges of each path have distinct colours). The minimum number of colours for which there exists a rainbow k-connected colouring for G is the rainbow k-connection number of G, and is denoted by rck(G). The function rck(G) was introduced by Chartrand et al. in 2008, and has since attracted considerable interest. In this… CONTINUE READING

From This Paper

Topics from this paper.
2 Citations
10 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 10 references


  • Y. Caro, A. Lev, Y. Roditty
  • Tuza, and R. Yuster, On rainbow connection…
  • 2008
3 Excerpts

Similar Papers

Loading similar papers…