Geodesic
How Intricate are (2s + 1)-Factorizations?
Canadian mathematical bulletin, Tome 30 (1987) no. 2, pp. 241-247

Voir la notice de l'article provenant de la source Cambridge University Press

The intricacy of the problem of (2s + 1 )-factorizating Kn is determined. Some generalizations are also given.
DOI : 10.4153/CMB-1987-034-2
Mots-clés : 05C99 
Hilton, A. J. W. How Intricate are (2s + 1)-Factorizations?. Canadian mathematical bulletin, Tome 30 (1987) no. 2, pp. 241-247. doi: 10.4153/CMB-1987-034-2
@article{10_4153_CMB_1987_034_2,
     author = {Hilton, A. J. W.},
     title = {How {Intricate} are (2s + {1)-Factorizations?}},
     journal = {Canadian mathematical bulletin},
     pages = {241--247},
     year = {1987},
     volume = {30},
     number = {2},
     doi = {10.4153/CMB-1987-034-2},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1987-034-2/}
}
TY  - JOUR
AU  - Hilton, A. J. W.
TI  - How Intricate are (2s + 1)-Factorizations?
JO  - Canadian mathematical bulletin
PY  - 1987
SP  - 241
EP  - 247
VL  - 30
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1987-034-2/
DO  - 10.4153/CMB-1987-034-2
ID  - 10_4153_CMB_1987_034_2
ER  - 
%0 Journal Article
%A Hilton, A. J. W.
%T How Intricate are (2s + 1)-Factorizations?
%J Canadian mathematical bulletin
%D 1987
%P 241-247
%V 30
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1987-034-2/
%R 10.4153/CMB-1987-034-2
%F 10_4153_CMB_1987_034_2

[1] 1. Chetwynd, A.G. and Hilton, A. J.W., Regular graphs of high degree are I-factor liable, Proc. London Math. Soc, 50 (1985), pp. 193–206. Google Scholar

[2] 2. Chvatal, V., On Hamilton s Ideals, J. Comb. Theory (B), 12 (1972), pp. 163–168. Google Scholar

[3] 3. Dirac, G.A., Some theorems on abstract graphs, Proc. London Math. Soc. (3), 2 (1952), pp. 69—81. Google Scholar

[4] 4. Hilton, A. J.W., Factorizations of regular graphs of high degree, J. Graph Theory, 9 (1985), 193–196. Google Scholar

[5] 5. Bill, Jackson, Edge-disjoint Hamilton cycles In regular graphs of large degree, J. London Math. Soc. (2), 19(1979), pp. 13–16. Google Scholar

[6] 6. Opencomb, W.E., On the intricacy of combinatorial construction problems, Discrete Math. 50 (1984), pp. 71–97. Google Scholar

[7] 7. Petersen, J., Die Thorie der regulären Graphen, Acta Math., 15 (1891), pp. 193–220. Google Scholar

Cité par Sources :