2 Hits in 1.6 sec

Pancomponented 2-factorizations of complete graphs

Dalibor Froncek, Brett Stevens
2005 Discrete Mathematics  
We pose and solve the existence of 2-factorizations of complete graphs and complete bipartite graphs that have the number of cycles per 2-factor varying, called pancomponented.  ...  Such 2-factorizations exist for all such graphs.  ...  Acknowledgements Dalibor Froncek would like to thank the Department of Mathematics and Statistics of the University of Vermont where he was visiting while the early versions of this paper were written.  ... 
doi:10.1016/j.disc.2004.09.014 fatcat:rjxdzndhcvak5kf5tulsfjovoa


2005 Discrete Mathematics  
Stevens Pancomponented 2-factorizations of complete graphs 99 P. Hell and J. Huang A generalization of the theorem of Lekkerkerker and Boland 113 P.  ...  Klavzˇar On median nature and enumerative properties of Fibonacci-like cubes 145 M. Kobayashi, G. Nakamura and C. Nara Uniform coverings of 2-paths with 5-paths in the complete graph 154 Y.  ... 
doi:10.1016/s0012-365x(05)00407-3 fatcat:rxvtxpybhzgy3krwwreznodnvy