On the equitable k*-laceability of hypercubes

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

Title:	On the equitable k*-laceability of hypercubes
Authors:	Chang,Chung-Haw;Sun,Chao-Ming;Huang,Hua-Min;Hsu,Lih-Hsing
Contributors:	數學研究所
Keywords:	SUPER LACEABILITY;GRAPHS
Date:	2007
Issue Date:	2010-07-07 11:40:24 (UTC+8)
Publisher:	中央大學
Abstract:	Let G be a finite undirected bipartite graph. Let u, v be two vertices of G from different partite sets. A collection of k internal vertex disjoint paths joining u to v is referred as a k-container C-k (u,v). A k-container is a k(*)-container if it spans
Relation:	JOURNAL OF COMBINATORIAL OPTIMIZATION
Appears in Collections:	[Graduate Institute of Mathematics] journal & Dissertation

Files in This Item:

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

社群 sharing