论文信息 - Rainbow connection number of Connected Graph

Rainbow connection number of Connected Graph

A path of a connected graph is rainbow if no two edges of it are colored the same. An edge-coloring graph is rainbow connected if a rainbow path connects any two vertices. An edge coloring under which is rainbow connected is called a rainbow coloring. The rainbow connection number of a connected graph , denoted by , as the smallest number of colors that are needed in order to make rainbow connected. In this paper, we construct different type of connected graph and determine the exact value of for them.

Richa Jain | Maneesha Sakalle

[1] Raphael Yuster,et al. The rainbow connection of a graph is (at most) reciprocal to its minimum degree , 2010, J. Graph Theory.

[2] G. Chartrand,et al. Rainbow trees in graphs and generalized connectivity , 2010 .

[3] Gary Chartrand,et al. Introduction to Graph Theory , 2004 .

[4] Charles J. Colbourn,et al. Series-parallel subgraphs of planar graphs , 1992, Networks.

[5] Raphael Yuster,et al. Hardness and algorithms for rainbow connection , 2008, J. Comb. Optim..

[6] Raphael Yuster,et al. On Rainbow Connection , 2008, Electron. J. Comb..

[7] Xueliang Li,et al. Rainbow Connections of Graphs: A Survey , 2011, Graphs Comb..