Geodesic
Large Matchings in Graphs
Canadian journal of mathematics, Tome 26 (1974) no. 6, pp. 1498-1508

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

How large a matching must a graph have?We consider graphs G (finite, undirected, with no loops or multiple edges), with order nG (always ≧ 1) and mG the maximum number of edges in a matching of G. The matchability μG of G is the fraction (2m/n) of nodes covered by a maximum matching. 
Weinstein, J. Large Matchings in Graphs. Canadian journal of mathematics, Tome 26 (1974) no. 6, pp. 1498-1508. doi: 10.4153/CJM-1974-145-8
@article{10_4153_CJM_1974_145_8,
     author = {Weinstein, J.},
     title = {Large {Matchings} in {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {1498--1508},
     year = {1974},
     volume = {26},
     number = {6},
     doi = {10.4153/CJM-1974-145-8},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1974-145-8/}
}
TY  - JOUR
AU  - Weinstein, J.
TI  - Large Matchings in Graphs
JO  - Canadian journal of mathematics
PY  - 1974
SP  - 1498
EP  - 1508
VL  - 26
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1974-145-8/
DO  - 10.4153/CJM-1974-145-8
ID  - 10_4153_CJM_1974_145_8
ER  - 
%0 Journal Article
%A Weinstein, J.
%T Large Matchings in Graphs
%J Canadian journal of mathematics
%D 1974
%P 1498-1508
%V 26
%N 6
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1974-145-8/
%R 10.4153/CJM-1974-145-8
%F 10_4153_CJM_1974_145_8

[1] 1. Berge, C., The theory of graphs and its applications (Methuen, London, 1962; reprinted 1966). Google Scholar

[2] 2. Moon, J., On independent complete subgraphs in a graph, Can. J. Math. 20 (1968), 95–102. Google Scholar

[3] 3. Ore, O., The four-color problem (Academic Press, New York-London, 1967). Google Scholar

[4] 4. Weinstein, J., On the number of disjoint edges in a graph, Can. J. Math. 15 (1963), 106–111. Google Scholar

Cité par Sources :