Pancomponented 2-factorizations of complete graphs
From MaRDI portal
Publication:2568477
DOI10.1016/j.disc.2004.09.014zbMath1073.05055OpenAlexW2078558807WikidataQ114190808 ScholiaQ114190808MaRDI QIDQ2568477
Brett Stevens, Dalibor Fronček
Publication date: 10 October 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.09.014
Cites Work
- Unnamed Item
- The solution of the bipartite analogue of the Oberwolfach problem
- The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
- The Oberwolfach problem and factors of uniform odd length cycles
- On a generalization of the Oberwolfach problem
- Some observations on the oberwolfach problem
- Even cycle decompositions of complete graphs minus a 1‐factor
- A generalization of the Oberwolfach problem
- The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order
This page was built for publication: Pancomponented 2-factorizations of complete graphs