JCO
2007
13 years 11 months ago
2007
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...
JGT
2008
13 years 11 months ago
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 satisf...