Sciweavers

JCO
2007
74views more  JCO 2007»
14 years 11 days ago
Maximum cyclic 4-cycle packings of the complete multipartite graph
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
Shung-Liang Wu, Hung-Lin Fu
JGT
2008
88views more  JGT 2008»
14 years 13 days ago
On minimum sets of 1-factors covering a complete multipartite graph
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 satisf...
David Cariolaro, Hung-Lin Fu