A generalization of the Oberwolfach problem, proposed by Liu (J Comb Des 8:42-49, 2000), asks for a uniform 2-factorization of the complete multipartite graph K-m x n. Here we focus our attention on cyclic 2-factorizations, whose 2-factors are disjoint union of cycles all of even length l. In particular, we present a complete solution for the extremal cases l = 4 and l = mn.
Cyclic Uniform 2-Factorizations of the Complete Multipartite Graph
Anita Pasotti;Marco Antonio Pellegrini
2018-01-01
Abstract
A generalization of the Oberwolfach problem, proposed by Liu (J Comb Des 8:42-49, 2000), asks for a uniform 2-factorization of the complete multipartite graph K-m x n. Here we focus our attention on cyclic 2-factorizations, whose 2-factors are disjoint union of cycles all of even length l. In particular, we present a complete solution for the extremal cases l = 4 and l = mn.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
