The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order
The electronic journal of combinatorics, Tome 9 (2002)
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of $K_{2n+1}$, not with consistent cycle components in each 2-factor like the Oberwolfach problem, but such that every admissible cycle size appears at least once in some 2-factor. The solution takes advantage of both Piotrowski's decomposition techniques used to solve Oberwolfach problems and the techniques used by the author to solve the undirected anti-Oberwolfach problem.
@article{10_37236_1633,
author = {Brett Stevens},
title = {The directed {anti-Oberwolfach} solution: {Pancyclic} 2-factorizations of complete directed graphs of odd order},
journal = {The electronic journal of combinatorics},
year = {2002},
volume = {9},
doi = {10.37236/1633},
zbl = {1004.05049},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1633/}
}
TY - JOUR AU - Brett Stevens TI - The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order JO - The electronic journal of combinatorics PY - 2002 VL - 9 UR - http://geodesic.mathdoc.fr/articles/10.37236/1633/ DO - 10.37236/1633 ID - 10_37236_1633 ER -
Brett Stevens. The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order. The electronic journal of combinatorics, Tome 9 (2002). doi: 10.37236/1633
Cité par Sources :