-cycle free one-factorizations of complete graphs.
The Electronic Journal of Combinatorics [electronic only] (2009)
- Volume: 16, Issue: 1, page Research Paper R3, 14 p.-Research Paper R3, 14 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topMeszka, Mariusz. "-cycle free one-factorizations of complete graphs.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper R3, 14 p.-Research Paper R3, 14 p.. <http://eudml.org/doc/117289>.
@article{Meszka2009,
author = {Meszka, Mariusz},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {one-factorization; complete graph},
language = {eng},
number = {1},
pages = {Research Paper R3, 14 p.-Research Paper R3, 14 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {-cycle free one-factorizations of complete graphs.},
url = {http://eudml.org/doc/117289},
volume = {16},
year = {2009},
}
TY - JOUR
AU - Meszka, Mariusz
TI - -cycle free one-factorizations of complete graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper R3, 14 p.
EP - Research Paper R3, 14 p.
LA - eng
KW - one-factorization; complete graph
UR - http://eudml.org/doc/117289
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.