Discussiones Mathematicae Graph Theory 32(2) (2012)
63-80

doi: 10.7151/dmgt.1586

Futaba Fujie-Okamoto
Mathematics Department | Kyle Kolasinski, Jianwei Lin, Ping Zhang
Department of Mathematics |

**Keywords:** rainbow path, vertex rainbow coloring, vertex rainbow connection number

**2010 Mathematics Subject Classification:** 05C15, 05C40.

[1] | G. Chartrand, G.L. Johns, K.A. McKeon and P. Zhang, Rainbow connection in graphs, Math. Bohem. 133 (2008) 85--98. |

[2] | G. Chartrand, G.L. Johns, K.A. McKeon and P. Zhang, The rainbow connectivity of a graph, Networks 54 (2009) 75--81, doi: 10.1002/net.20296. |

[3] | G. Chartrand, F. Okamoto and P. Zhang, Rainbow trees in graphs and generalized connectivity, Networks 55 (2010) 360--367. |

[4] | G. Chartrand and P. Zhang, Chromatic Graph Theory (Chapman & Hall/CRC Press, 2009). |

[5] | M. Krivelevich and R. Yuster,The rainbow connection of a graph is (at most) reciprocal to its minimum degree, J. Graph Theory 63 (2010) 185--191 |

[6] | H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 (1932) 150--168, doi: 10.2307/2371086. |

Received 15 June 2010

Revised 20 January 2011

Accepted 24 January 2011