k-cycle free one-factorizations of complete graphs.
Meszka, Mariusz
The Electronic Journal of Combinatorics [electronic only], Tome 16 (2009), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2009-01-01
EUDML-ID : urn:eudml:doc:117289 
@article{05541068,
     title = {<title-group xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><article-title xml:lang="en"><math><mi>k</mi></math>-cycle free one-factorizations of complete graphs.</article-title></title-group>},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {16},
     year = {2009},
     zbl = {1178.05077},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05541068}
}

Meszka, Mariusz. k-cycle free one-factorizations of complete graphs.. The Electronic Journal of Combinatorics [electronic only], Tome 16 (2009) . http://gdmltest.u-ga.fr/item/05541068/