Geodesic
Matchings construction procedure
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012).

Voir la notice de l'article provenant de la source Math-Net.Ru

Conditions for the existence of consecutive matchings in a bipartite graph are considered. 
@article{PDMA_2012_5_a49,
     author = {T. A. Magomedov},
     title = {Matchings construction procedure},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {95},
     publisher = {mathdoc},
     number = {5},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2012_5_a49/}
}
TY  - JOUR
AU  - T. A. Magomedov
TI  - Matchings construction procedure
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2012
SP  - 95
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2012_5_a49/
LA  - ru
ID  - PDMA_2012_5_a49
ER  - 
%0 Journal Article
%A T. A. Magomedov
%T Matchings construction procedure
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2012
%P 95
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2012_5_a49/
%G ru
%F PDMA_2012_5_a49
T. A. Magomedov. Matchings construction procedure. Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012). http://geodesic.mathdoc.fr/item/PDMA_2012_5_a49/

[1] Svami M., Tkhulasiraman K., Grafy, seti i algoritmy, Mir, M., 1984