Geodesic
On Edge-Disjoint Cycles in a Graph
Canadian mathematical bulletin, Tome 7 (1964) no. 4, pp. 519-523

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

Let g(k) denote the least integer such that every graph , with n vertices and n+g(k) edges, contains at least k edge-disjoint cycles; let h(k) be similarly defined for planar graphs. Loops and multiple edges (i.e., cycles of length one and two) are permitted in both cases. 
Moon, J. W. On Edge-Disjoint Cycles in a Graph. Canadian mathematical bulletin, Tome 7 (1964) no. 4, pp. 519-523. doi: 10.4153/CMB-1964-048-2
@article{10_4153_CMB_1964_048_2,
     author = {Moon, J. W.},
     title = {On {Edge-Disjoint} {Cycles} in a {Graph}},
     journal = {Canadian mathematical bulletin},
     pages = {519--523},
     year = {1964},
     volume = {7},
     number = {4},
     doi = {10.4153/CMB-1964-048-2},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-048-2/}
}
TY  - JOUR
AU  - Moon, J. W.
TI  - On Edge-Disjoint Cycles in a Graph
JO  - Canadian mathematical bulletin
PY  - 1964
SP  - 519
EP  - 523
VL  - 7
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-048-2/
DO  - 10.4153/CMB-1964-048-2
ID  - 10_4153_CMB_1964_048_2
ER  - 
%0 Journal Article
%A Moon, J. W.
%T On Edge-Disjoint Cycles in a Graph
%J Canadian mathematical bulletin
%D 1964
%P 519-523
%V 7
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-048-2/
%R 10.4153/CMB-1964-048-2
%F 10_4153_CMB_1964_048_2

[1] 1. Dirac, G. and Erdős, P., On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hung. 14 (1963), 79–94. Google Scholar | DOI

[2] 2. Erdős, P.and Pósa, L., On the maximal number of disjoint circuits in a graph, Publ. Math. Debrecen 9 (1962), 3–12. Google Scholar

[3] 3. Grűnbaum, B. and Motzkin, T.S., The number of hexagons and the simplicity of geodesies on certain polyhedra, Canad. J. Math. 15 (1963), 744–751. Google Scholar | DOI

[4] 4. Steinitz, E., Vorlesungen fiber die Th?orie der Polyeder (Berlin, 1934). Google Scholar

Cité par Sources :