Geodesic
A polynomial algorithm for finding minimal vertex coverings for a class of planar graphs
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (1980), pp. 75-77 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{IVM_1980_1_a16,
     author = {E. B. Kinber},
     title = {A~polynomial algorithm for finding minimal vertex coverings for a~class of planar graphs},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {75--77},
     year = {1980},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1980_1_a16/}
}
TY  - JOUR
AU  - E. B. Kinber
TI  - A polynomial algorithm for finding minimal vertex coverings for a class of planar graphs
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1980
SP  - 75
EP  - 77
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/IVM_1980_1_a16/
LA  - ru
ID  - IVM_1980_1_a16
ER  - 
%0 Journal Article
%A E. B. Kinber
%T A polynomial algorithm for finding minimal vertex coverings for a class of planar graphs
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1980
%P 75-77
%N 1
%U http://geodesic.mathdoc.fr/item/IVM_1980_1_a16/
%G ru
%F IVM_1980_1_a16
E. B. Kinber. A polynomial algorithm for finding minimal vertex coverings for a class of planar graphs. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (1980), pp. 75-77. http://geodesic.mathdoc.fr/item/IVM_1980_1_a16/