Abstract
In this chapter, we survey the results on rainbow k-connectivity. An example, the graph H = K 3 □ K 2, in [16] is given to illustrate this concept, see Fig. 7.1. Because the diameter of H is 2 and there is a 2-rainbow-coloring of H, we have \(r{c}_{1}(H) = rc(H) = 2\). Because H = K 3 □ K 2 has connectivity 3, the numbers rc 2(H) and rc 3(H) are also defined. We first establish the value of rc 2(H). Consider the 3-edge-coloring of H shown in Fig. 7.1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Xueliang Li, Yuefang Sun
About this chapter
Cite this chapter
Li, X., Sun, Y. (2012). Rainbow Connectivity. In: Rainbow Connections of Graphs. SpringerBriefs in Mathematics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-3119-0_7
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3119-0_7
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-3118-3
Online ISBN: 978-1-4614-3119-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)