Geodesic
Decompositions of complete graphs into bipartite 2-regular subgraphs
The electronic journal of combinatorics, Tome 23 (2016) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

It is shown that if $G$ is any bipartite 2-regular graph of order at most $n/2$ or at least $n-2$, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order $n$ into a perfect matching and edge-disjoint copies of $G$.
DOI : 10.37236/4634
Classification : 05C70, 05C51, 05B30
Mots-clés : graph decompositions 
@article{10_37236_4634,
     author = {Darryn Bryant and Andrea Burgess and Peter Danziger},
     title = {Decompositions of complete graphs into bipartite 2-regular subgraphs},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {2},
     doi = {10.37236/4634},
     zbl = {1335.05136},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/4634/}
}
TY  - JOUR
AU  - Darryn Bryant
AU  - Andrea Burgess
AU  - Peter Danziger
TI  - Decompositions of complete graphs into bipartite 2-regular subgraphs
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/4634/
DO  - 10.37236/4634
ID  - 10_37236_4634
ER  - 
%0 Journal Article
%A Darryn Bryant
%A Andrea Burgess
%A Peter Danziger
%T Decompositions of complete graphs into bipartite 2-regular subgraphs
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/4634/
%R 10.37236/4634
%F 10_37236_4634
Darryn Bryant; Andrea Burgess; Peter Danziger. Decompositions of complete graphs into bipartite 2-regular subgraphs. The electronic journal of combinatorics, Tome 23 (2016) no. 2. doi: 10.37236/4634

Cité par Sources :