Rainbow Connectivity

Chapter
Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

Abstract

In this chapter, we survey the results on rainbow k-connectivity. An example, the graph H = K 3K 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 3K 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.

Keywords

Extractor 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Xueliang Li, Yuefang Sun 2012

Authors and Affiliations

  1. 1.Center for CombinatoricsNankai UniversityTianjinP.R. China

Personalised recommendations