Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Complete Equipartite Graphs"”.
-
Cycle and closed trail decompositions of complete equipartite graphs and complete multigraphs
… thesis, we will study decompositions of certain graphs into cycles and closed trails. In particular, we consider decompositions of complete multigraphs and complete equipartite graphs. The complete multigraph lambdaKm is the multigraph with m vertices and lambda edges between each pair of …
-
Two Problems of Gerhard Ringel
… 2 generalizes the Hamilton-Waterloo Problem to complete equipartite graphs K(n:m) and shows that K(xyzw:m) can be decomposed into s copies of a 2-factor consisting of cycles of length xzm and r copies of a 2-factor consisting of cycles of length yzm, whenever m is odd, s,r≠1, gcd(x,z)=gcd(y,z)=1 …