Geodesic
Packing and Covering of the Complete Graph with 4-Cycles*
Canadian mathematical bulletin, Tome 18 (1975) no. 5, pp. 703-708

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

DOI

The maximal number of pairwise edge disjoint 4-cycles in the complete graph Kn and the minimal number of 4-cycles whose union is Kn are determined. 
Packing and Covering of the Complete Graph with 4-Cycles*. Canadian mathematical bulletin, Tome 18 (1975) no. 5, pp. 703-708. doi: 10.4153/CMB-1975-123-4
@misc{10_4153_CMB_1975_123_4,
     title = {Packing and {Covering} of the {Complete} {Graph} with {4-Cycles*}},
     journal = {Canadian mathematical bulletin},
     pages = {703--708},
     year = {1975},
     volume = {18},
     number = {5},
     doi = {10.4153/CMB-1975-123-4},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1975-123-4/}
}
TY  - JOUR
TI  - Packing and Covering of the Complete Graph with 4-Cycles*
JO  - Canadian mathematical bulletin
PY  - 1975
SP  - 703
EP  - 708
VL  - 18
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1975-123-4/
DO  - 10.4153/CMB-1975-123-4
ID  - 10_4153_CMB_1975_123_4
ER  - 
%0 Journal Article
%T Packing and Covering of the Complete Graph with 4-Cycles*
%J Canadian mathematical bulletin
%D 1975
%P 703-708
%V 18
%N 5
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1975-123-4/
%R 10.4153/CMB-1975-123-4
%F 10_4153_CMB_1975_123_4

Cité par Sources :