Total rainbow k-connection in graphs

@article{Liu2014TotalRK,
  title={Total rainbow k-connection in graphs},
  author={Henry Liu and Angela Mestre and Teresa Sousa},
  journal={Discrete Applied Mathematics},
  year={2014},
  volume={174},
  pages={92-101}
}
Let k be a positive integer and G be a k-connected graph. In 2009, Chartrand, Johns, McKeon, and Zhang introduced the rainbow k-connection number rck(G) of G. An edge-coloured path is rainbow if its edges have distinct colours. Then, rck(G) is the minimum number of colours required to colour the edges of G so that any two vertices of G are connected by k internally vertex-disjoint rainbow paths. The function rck(G) has since been studied by numerous researchers. An analogue of the function rck… CONTINUE READING
4 Citations
11 References
Similar Papers

Citations

Publications citing this paper.

References

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

Random Graphs

  • S. Janson, T. Luczak, A. Ruciński
  • Wiley-Interscience Series in Discrete Mathematics…
  • 2000

Modern Graph Theory

  • B. Bollobás
  • Springer-Verlag, New York
  • 1998
2 Excerpts

Similar Papers

Loading similar papers…