Geodesic
On the number of complete subgraphs and circuits contained in graphs
Časopis pro pěstování matematiky, Tome 094 (1969) no. 3, pp. 290-296.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI : 10.21136/CPM.1969.108598
Classification : 05C20 
@article{10_21136_CPM_1969_108598,
     author = {Erd\H{o}s, P\'al},
     title = {On the number of complete subgraphs and circuits contained in graphs},
     journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
     pages = {290--296},
     publisher = {mathdoc},
     volume = {094},
     number = {3},
     year = {1969},
     doi = {10.21136/CPM.1969.108598},
     mrnumber = {0252253},
     zbl = {0177.52502},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.108598/}
}
TY  - JOUR
AU  - Erdős, Pál
TI  - On the number of complete subgraphs and circuits contained in graphs
JO  - Časopis pro pěstování matematiky
PY  - 1969
SP  - 290
EP  - 296
VL  - 094
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.108598/
DO  - 10.21136/CPM.1969.108598
LA  - en
ID  - 10_21136_CPM_1969_108598
ER  - 
%0 Journal Article
%A Erdős, Pál
%T On the number of complete subgraphs and circuits contained in graphs
%J Časopis pro pěstování matematiky
%D 1969
%P 290-296
%V 094
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.108598/
%R 10.21136/CPM.1969.108598
%G en
%F 10_21136_CPM_1969_108598
Erdős, Pál. On the number of complete subgraphs and circuits contained in graphs. Časopis pro pěstování matematiky, Tome 094 (1969) no. 3, pp. 290-296. doi : 10.21136/CPM.1969.108598. http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.108598/

Cité par Sources :