Regular graphs and their spanning trees
Časopis pro pěstování matematiky, Tome 95 (1970) no. 4, pp. 420-426
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Sedláček, Jiří. Regular graphs and their spanning trees. Časopis pro pěstování matematiky, Tome 95 (1970) no. 4, pp. 420-426. doi: 10.21136/CPM.1970.108329
@article{10_21136_CPM_1970_108329,
author = {Sedl\'a\v{c}ek, Ji\v{r}{\'\i}},
title = {Regular graphs and their spanning trees},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {420--426},
year = {1970},
volume = {95},
number = {4},
doi = {10.21136/CPM.1970.108329},
mrnumber = {0282876},
zbl = {0201.56902},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1970.108329/}
}
[1] J. W. Moon: Various proofs of Cayley's formula for counting trees. A seminar on graph theory (F. Harary, ed.) 70-78. | MR
[2] J. Sedláček: Finite graphs and their spanning trees. Časopis Pěst. Mat. 92 (1967), 338-342. | MR
[3] J. Sedláček: On the spanning trees of finite graphs. Časopis Pӗst. Mat. 91 (1966), 221-227. | MR
[4] J. Sedláček: On the number of spanning trees of finite graphs. Časopis Pést. Mat. 94 (1969), 217-221. | MR
Cité par Sources :