Geodesic
Rank inequalities that generate facets of a polyhedron of connected $k$-factors
Diskretnyj analiz i issledovanie operacij, Tome 3 (1996) no. 3, pp. 84-110 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DA_1996_3_3_a4,
     author = {R. Yu. Simanchev},
     title = {Rank inequalities that generate facets of a~polyhedron of connected $k$-factors},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {84--110},
     year = {1996},
     volume = {3},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1996_3_3_a4/}
}
TY  - JOUR
AU  - R. Yu. Simanchev
TI  - Rank inequalities that generate facets of a polyhedron of connected $k$-factors
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1996
SP  - 84
EP  - 110
VL  - 3
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/DA_1996_3_3_a4/
LA  - ru
ID  - DA_1996_3_3_a4
ER  - 
%0 Journal Article
%A R. Yu. Simanchev
%T Rank inequalities that generate facets of a polyhedron of connected $k$-factors
%J Diskretnyj analiz i issledovanie operacij
%D 1996
%P 84-110
%V 3
%N 3
%U http://geodesic.mathdoc.fr/item/DA_1996_3_3_a4/
%G ru
%F DA_1996_3_3_a4
R. Yu. Simanchev. Rank inequalities that generate facets of a polyhedron of connected $k$-factors. Diskretnyj analiz i issledovanie operacij, Tome 3 (1996) no. 3, pp. 84-110. http://geodesic.mathdoc.fr/item/DA_1996_3_3_a4/