On spanning connected graphs

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/33596

Title:	On spanning connected graphs
Authors:	Lin,Cheng-Kuan;Huang,Hua-Min;Tan,Jimmy J. M.;Hsu,Lih-Hsing
Contributors:	數學研究所
Date:	2008
Issue Date:	2010-07-07 11:39:25 (UTC+8)
Publisher:	中央大學
Abstract:	A k-container C(u, v) of G between u and v is a set of k internally disjoint paths between u and v. A k-container C(u, v) of G is a k-container if the set of the vertices of all the paths in C(u, v) contains all the vertices of G. A graph G is k-connect
Relation:	DISCRETE MATHEMATICS????
Appears in Collections:	[Graduate Institute of Mathematics] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	344	View/Open

社群 sharing