Short disjoint paths in locally connected graphs

doi:10.1007/s00373-007-0754-8

CSpace

	Short disjoint paths in locally connected graphs
	Chen, Chuanping ; Cada, Roman ; Kaiser, Tomas ; Ryjacek, Zdenek
	2007-10-01
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	23 期号:5 页码:509-519
摘要	Chartrand and Pippert proved that a connected, locally k-connected graph is (k + 1)-connected. We investigate the lengths of k + 1 disjoint paths between two vertices in locally k-connected graphs with respect to several graph parameters, e.g. the k-diameter of a graph. We also give a generalization of the mentioned result.
关键词	connectivity local connectivity diameter disjoint paths
DOI	10.1007/s00373-007-0754-8
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000250205800003
出版者	SPRINGER TOKYO
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/4385
专题	中国科学院数学与系统科学研究院
通讯作者	Chen, Chuanping
作者单位	1.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China 2.Univ W Bohemia, Dept Math, Plzen 30614, Czech Republic
推荐引用方式 GB/T 7714	Chen, Chuanping,Cada, Roman,Kaiser, Tomas,et al. Short disjoint paths in locally connected graphs[J]. GRAPHS AND COMBINATORICS,2007,23(5):509-519.
APA	Chen, Chuanping,Cada, Roman,Kaiser, Tomas,&Ryjacek, Zdenek.(2007).Short disjoint paths in locally connected graphs.GRAPHS AND COMBINATORICS,23(5),509-519.
MLA	Chen, Chuanping,et al."Short disjoint paths in locally connected graphs".GRAPHS AND COMBINATORICS 23.5(2007):509-519.