Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
@article{10_21136_CPM_1969_117654, author = {Sedl\'a\v{c}ek, Ji\v{r}{\'\i}}, title = {On the number of spanning trees of finite graphs}, journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky}, pages = {217--221}, publisher = {mathdoc}, volume = {094}, number = {2}, year = {1969}, doi = {10.21136/CPM.1969.117654}, mrnumber = {0250931}, zbl = {0175.20902}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.117654/} }
TY - JOUR AU - Sedláček, Jiří TI - On the number of spanning trees of finite graphs JO - Časopis pro pěstování matematiky PY - 1969 SP - 217 EP - 221 VL - 094 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.117654/ DO - 10.21136/CPM.1969.117654 LA - en ID - 10_21136_CPM_1969_117654 ER -
Sedláček, Jiří. On the number of spanning trees of finite graphs. Časopis pro pěstování matematiky, Tome 094 (1969) no. 2, pp. 217-221. doi : 10.21136/CPM.1969.117654. http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.117654/
Cité par Sources :