Abstract
Some graph classes such as line graphs have many special properties, and by these properties we can get some interesting results on their rainbow connection numbers in terms of some graph parameters. For example, in [11, 69], Caro et al. and Li and Liu derived Theorem 3.2.1 and Theorem 3.2.6, respectively, according to the ear decomposition of a 2-connected graph. In this subsection, we will introduce some results on the rainbow connection numbers of line graphs, etc.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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 Connection Numbers of Some Graph Classes. In: Rainbow Connections of Graphs. SpringerBriefs in Mathematics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-3119-0_5
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3119-0_5
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)