We pose and completely solve the existence of pancyclic 2-factorizations of complete graphs and complete bipartite graphs. Such 2-factorizations exist for all such graphs, except a few small cases which we have proved are impossible. The solution method is simple but powerful. The pancyclic problem is intended to showcase the power this method offers to solve a wide range of 2-factorization problems. Indeed, these methods go a long way towards being able to produce arbitrary 2-factorizations with one or two cycles per factor. © Springer-Verlag Berlin Heidelberg 2000.
CITATION STYLE
Stevens, B. (2000). The anti-oberwolfach solution: Pancyclic 2-factorizations of complete graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 115–122). https://doi.org/10.1007/10719839_12
Mendeley helps you to discover research relevant for your work.