Counting and selecting at random bipartite graphs with fixed degrees
RAIRO - Operations Research - Recherche Opérationnelle, Tome 24 (1990) no. 1, pp. 1-14. 
@article{RO_1990__24_1_1_0,
     author = {Gu\'enoche, A.},
     title = {Counting and selecting at random bipartite graphs with fixed degrees},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {1--14},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {1},
     year = {1990},
     mrnumber = {1057136},
     zbl = {0711.05026},
     language = {en},
     url = {http://www.numdam.org/item/RO_1990__24_1_1_0/}
}
TY  - JOUR
AU  - Guénoche, A.
TI  - Counting and selecting at random bipartite graphs with fixed degrees
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1990
SP  - 1
EP  - 14
VL  - 24
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1990__24_1_1_0/
LA  - en
ID  - RO_1990__24_1_1_0
ER  - 
%0 Journal Article
%A Guénoche, A.
%T Counting and selecting at random bipartite graphs with fixed degrees
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1990
%P 1-14
%V 24
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1990__24_1_1_0/
%G en
%F RO_1990__24_1_1_0
Guénoche, A. Counting and selecting at random bipartite graphs with fixed degrees. RAIRO - Operations Research - Recherche Opérationnelle, Tome 24 (1990) no. 1, pp. 1-14. http://www.numdam.org/item/RO_1990__24_1_1_0/

[1] Cl. Berge, Principes de Combinatoire, Dunod, Paris, 1968. | MR | Zbl

[2] A. Guénoche, Énumération de classes de permutations, RAIRO Recherche Opérationnelle, Vol. 13, No. 4, 1979, pp. 379-390. | Numdam | MR | Zbl

[3] H. Nijenhuis & H. Wilf, Combinatorial Algorithms, Acad. Press, New York, 1978. | MR | Zbl

[4] N. C. Wormald, Generating random regular graphs, Journal of Algorithms, Vol. 5, No. 2, 1984, pp. 247-280. | MR | Zbl