Geodesic
Density of graphs in which each edge is contained in at least two maximal cliques
Diskretnaya Matematika, Tome 25 (2013) no. 3, pp. 7-21

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

@article{DM_2013_25_3_a1,
     author = {I. A. Badekha and P. V. Roldugin},
     title = {Density of graphs in which each edge is contained in at least two maximal cliques},
     journal = {Diskretnaya Matematika},
     pages = {7--21},
     publisher = {mathdoc},
     volume = {25},
     number = {3},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2013_25_3_a1/}
}
TY  - JOUR
AU  - I. A. Badekha
AU  - P. V. Roldugin
TI  - Density of graphs in which each edge is contained in at least two maximal cliques
JO  - Diskretnaya Matematika
PY  - 2013
SP  - 7
EP  - 21
VL  - 25
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2013_25_3_a1/
LA  - ru
ID  - DM_2013_25_3_a1
ER  - 
%0 Journal Article
%A I. A. Badekha
%A P. V. Roldugin
%T Density of graphs in which each edge is contained in at least two maximal cliques
%J Diskretnaya Matematika
%D 2013
%P 7-21
%V 25
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2013_25_3_a1/
%G ru
%F DM_2013_25_3_a1
I. A. Badekha; P. V. Roldugin. Density of graphs in which each edge is contained in at least two maximal cliques. Diskretnaya Matematika, Tome 25 (2013) no. 3, pp. 7-21. http://geodesic.mathdoc.fr/item/DM_2013_25_3_a1/