Geodesic
Connected simple graphs and a selection problem
Czechoslovak Mathematical Journal, Tome 25 (1975) no. 2, pp. 300-301

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

DOI : 10.21136/CMJ.1975.101321
Classification : 26A15 
@article{10_21136_CMJ_1975_101321,
     author = {Jones, F. Burton},
     title = {Connected simple graphs and a selection problem},
     journal = {Czechoslovak Mathematical Journal},
     pages = {300--301},
     publisher = {mathdoc},
     volume = {25},
     number = {2},
     year = {1975},
     doi = {10.21136/CMJ.1975.101321},
     mrnumber = {0369627},
     zbl = {0309.05104},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1975.101321/}
}
TY  - JOUR
AU  - Jones, F. Burton
TI  - Connected simple graphs and a selection problem
JO  - Czechoslovak Mathematical Journal
PY  - 1975
SP  - 300
EP  - 301
VL  - 25
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1975.101321/
DO  - 10.21136/CMJ.1975.101321
LA  - en
ID  - 10_21136_CMJ_1975_101321
ER  - 
%0 Journal Article
%A Jones, F. Burton
%T Connected simple graphs and a selection problem
%J Czechoslovak Mathematical Journal
%D 1975
%P 300-301
%V 25
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1975.101321/
%R 10.21136/CMJ.1975.101321
%G en
%F 10_21136_CMJ_1975_101321
Jones, F. Burton. Connected simple graphs and a selection problem. Czechoslovak Mathematical Journal, Tome 25 (1975) no. 2, pp. 300-301. doi: 10.21136/CMJ.1975.101321

Cité par Sources :