Geodesic
\(k\)-cycle free one-factorizations of complete graphs
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

It is proved that for every $n\geq 3$ and every even $k\geq 4$, where $k\neq 2n$, there exists one-factorization of the complete graph $K_{2n}$ such that any two one-factors do not induce a graph with a cycle of length $k$ as a component. Moreover, some infinite classes of one-factorizations, in which lengths of cycles induced by any two one-factors satisfy a given lower bound, are constructed.
DOI : 10.37236/92
Classification : 05C70
Mots-clés : one-factorization, complete graph 
@article{10_37236_92,
     author = {Mariusz Meszka},
     title = {\(k\)-cycle free one-factorizations of complete graphs},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/92},
     zbl = {1178.05077},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/92/}
}
TY  - JOUR
AU  - Mariusz Meszka
TI  - \(k\)-cycle free one-factorizations of complete graphs
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/92/
DO  - 10.37236/92
ID  - 10_37236_92
ER  - 
%0 Journal Article
%A Mariusz Meszka
%T \(k\)-cycle free one-factorizations of complete graphs
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/92/
%R 10.37236/92
%F 10_37236_92
Mariusz Meszka. \(k\)-cycle free one-factorizations of complete graphs. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/92

Cité par Sources :