Geodesic
A characterization of well-covered graphs in terms of forbidden costable subgraphs
Matematičeskie zametki, Tome 67 (2000) no. 1, pp. 52-56

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

@article{MZM_2000_67_1_a5,
     author = {I. \'E. Zverovich},
     title = {A characterization of well-covered graphs in terms of forbidden costable subgraphs},
     journal = {Matemati\v{c}eskie zametki},
     pages = {52--56},
     publisher = {mathdoc},
     volume = {67},
     number = {1},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2000_67_1_a5/}
}
TY  - JOUR
AU  - I. É. Zverovich
TI  - A characterization of well-covered graphs in terms of forbidden costable subgraphs
JO  - Matematičeskie zametki
PY  - 2000
SP  - 52
EP  - 56
VL  - 67
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2000_67_1_a5/
LA  - ru
ID  - MZM_2000_67_1_a5
ER  - 
%0 Journal Article
%A I. É. Zverovich
%T A characterization of well-covered graphs in terms of forbidden costable subgraphs
%J Matematičeskie zametki
%D 2000
%P 52-56
%V 67
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2000_67_1_a5/
%G ru
%F MZM_2000_67_1_a5
I. É. Zverovich. A characterization of well-covered graphs in terms of forbidden costable subgraphs. Matematičeskie zametki, Tome 67 (2000) no. 1, pp. 52-56. http://geodesic.mathdoc.fr/item/MZM_2000_67_1_a5/