Connected simple graphs and a selection problem
Czechoslovak Mathematical Journal, Tome 25 (1975) no. 2, pp. 300-301
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@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},
year = {1975},
volume = {25},
number = {2},
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 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 -
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