Geodesic
Graphs with a~matroid number that does not exceed~2
Diskretnaya Matematika, Tome 2 (1990) no. 2, pp. 82-88.

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

Let $IG$ be the system of all the independent subsets of the vertices of a graph $G$. We study two classes of graphs – graphs for which $IG$ is the union of systems of independent sets of two matroids, and graphs for which $IG$ is represented in the form of an intersection of systems of independent sets of two matroids. The first of these classes is characterized in terms of prohibited generated subgraphs. For the second we prove its isomorphic completeness. 
@article{DM_1990_2_2_a6,
     author = {V. \`E. Zverovich and I. \'E. Zverovich and R. I. Tyshkevich},
     title = {Graphs with a~matroid number that does not exceed~2},
     journal = {Diskretnaya Matematika},
     pages = {82--88},
     publisher = {mathdoc},
     volume = {2},
     number = {2},
     year = {1990},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1990_2_2_a6/}
}
TY  - JOUR
AU  - V. È. Zverovich
AU  - I. É. Zverovich
AU  - R. I. Tyshkevich
TI  - Graphs with a~matroid number that does not exceed~2
JO  - Diskretnaya Matematika
PY  - 1990
SP  - 82
EP  - 88
VL  - 2
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1990_2_2_a6/
LA  - ru
ID  - DM_1990_2_2_a6
ER  - 
%0 Journal Article
%A V. È. Zverovich
%A I. É. Zverovich
%A R. I. Tyshkevich
%T Graphs with a~matroid number that does not exceed~2
%J Diskretnaya Matematika
%D 1990
%P 82-88
%V 2
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1990_2_2_a6/
%G ru
%F DM_1990_2_2_a6
V. È. Zverovich; I. É. Zverovich; R. I. Tyshkevich. Graphs with a~matroid number that does not exceed~2. Diskretnaya Matematika, Tome 2 (1990) no. 2, pp. 82-88. http://geodesic.mathdoc.fr/item/DM_1990_2_2_a6/