On minimum sets of 1-factors covering a complete multipartite graph

標題:	On minimum sets of 1-factors covering a complete multipartite graph
作者:	Cariolaro, David Fu, Hung-Lin 應用數學系 Department of Applied Mathematics
關鍵字:	1-factor;1-factor cover;excessive factorization;excessive index;complete multipartite graph
公開日期:	1-Jul-2008
摘要:	We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1-factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. (c) 2008 Wiley Periodicals, hic.
URI:	http://dx.doi.org/10.1002/jgt.20303 http://hdl.handle.net/11536/8681
ISSN:	0364-9024
DOI:	10.1002/jgt.20303
期刊:	JOURNAL OF GRAPH THEORY
Volume:	58
Issue:	3
起始頁:	239
結束頁:	250
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.