Rainbow Connection in 3-Connected Graphs

被引：0
|
作者：
Xueliang Li
Yongtang Shi
机构：
[1] Nankai University,Center for Combinatorics and LPMC
来源：
Graphs and Combinatorics | 2013年 / 29卷
关键词：
Rainbow connection; Connectivity; The fan lemma; 05C15; 05C40;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this paper, we proved that rc(G) ≤ 3(n + 1)/5 for all 3-connected graphs.
引用
收藏
页码：1471 / 1475
页数：4
相关论文
共 50 条
12345