TY - JOUR
T1 - Cyclic Uniform 2-Factorizations of the Complete Multipartite Graph
AU - Pasotti, Anita
AU - Pellegrini, Marco Antonio
PY - 2018
Y1 - 2018
N2 - 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 Km×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.
AB - 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 Km×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.
KW - 2-factorization
KW - Complete multipartite graph
KW - Cycle
KW - 2-factorization
KW - Complete multipartite graph
KW - Cycle
UR - http://hdl.handle.net/10807/125384
U2 - 10.1007/s00373-018-1920-x
DO - 10.1007/s00373-018-1920-x
M3 - Article
SN - 0911-0119
VL - 34
SP - 901
EP - 930
JO - Graphs and Combinatorics
JF - Graphs and Combinatorics
ER -