Rainbow vertex k-connection in graphs

@article{Liu2013RainbowVK,
  title={Rainbow vertex k-connection in graphs},
  author={Henry Liu and Angela Mestre and Teresa Sousa},
  journal={Discrete Applied Mathematics},
  year={2013},
  volume={161},
  pages={2549-2555}
}
Let k be a positive integer and G be a k-connected graph. An edge-coloured path is rainbow if its edges have distinct colours. The rainbow k-connection number of G, denoted by 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) was first introduced by Chartrand, Johns, McKeon, and Zhang in 2009, and has since attracted considerable interest. In this paper, we… CONTINUE READING

References

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

Rainbow vertex-connection number of 2-connected graphs

  • X. Li, S. Liu
  • arXiv:1110.5770v1
  • 2011
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…