Abstract
All the above parameters on rainbow connections involved edge-colorings of graphs. A natural idea is to introduce a similar parameter involving vertex-colorings of graphs. It is, as mentioned above, a vertex version of the rainbow connection number. Krivelevich and Yuster (J. Graph Theory 63(3):185–191, 2009) is the first to propose this new concept and proved a theorem analogous to the result of Theorem 3.1.10.
This is a preview of subscription content, log in via an institution to check access.
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 Vertex-Connection Number. In: Rainbow Connections of Graphs. SpringerBriefs in Mathematics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-3119-0_8
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3119-0_8
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)