Geodesic
Decomposing complete equipartite graphs into short odd cycles
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper we examine the problem of decomposing the lexicographic product of a cycle with an empty graph into cycles of uniform length. We determine necessary and sufficient conditions for a solution to this problem when the cycles are of odd length. We apply this result to find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both odd and short relative to the number of parts.
DOI : 10.37236/402
Classification : 05C38, 05C51
Mots-clés : lexicographic product of a cycle 
@article{10_37236_402,
     author = {Benjamin R. Smith and Nicholas J. Cavenagh},
     title = {Decomposing complete equipartite graphs into short odd cycles},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/402},
     zbl = {1231.05151},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/402/}
}
TY  - JOUR
AU  - Benjamin R. Smith
AU  - Nicholas J. Cavenagh
TI  - Decomposing complete equipartite graphs into short odd cycles
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/402/
DO  - 10.37236/402
ID  - 10_37236_402
ER  - 
%0 Journal Article
%A Benjamin R. Smith
%A Nicholas J. Cavenagh
%T Decomposing complete equipartite graphs into short odd cycles
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/402/
%R 10.37236/402
%F 10_37236_402
Benjamin R. Smith; Nicholas J. Cavenagh. Decomposing complete equipartite graphs into short odd cycles. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/402

Cité par Sources :