@article{10_21136_CPM_1966_117545,
author = {Rohl{\'\i}\v{c}kov\'a, Iva},
title = {Pozn\'amka o po\v{c}tu koster grafu},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {89--91},
year = {1966},
volume = {91},
number = {1},
doi = {10.21136/CPM.1966.117545},
mrnumber = {0190034},
zbl = {0151.33303},
language = {cs},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1966.117545/}
}
Rohlíčková, Iva. Poznámka o počtu koster grafu. Časopis pro pěstování matematiky, Tome 91 (1966) no. 1, pp. 89-91. doi: 10.21136/CPM.1966.117545
[1] A. Cayley: Collected Mathematical Papers. (1889-1897), Cambridge University Press, Vol. 13, pp. 26-28. | Zbl
[2] H. M. Trent: A Note on the Enumeration and Listing of all possible Trees in a conected linear Graph. Proc. Natl. Acad. Sci., Vol. 40, pp. 1004-1007, October 1954. | MR
[3] L. Weinberg: Number of Trees in a Graph. Proc. IRE, Vol. 46 No. 12, pp. 1954-1955, Dec., 1958.
[4] M. Fiedler J. Sedláček: O W-basích orientovaných grafů. Časopis pro pěstování matematiky, 83 (1958), 214-225. | MR
[5] T. Austin: The Enumeration of Point labelled chromatic Graphs and Trees. Canadian Journal Math. XII - 1960, 535-545. | MR | Zbl
[6] I. Rohlíčková: Dva doplňky ke Cayleyho vzorci. Sborník Pedagogického institutu v Praze, Přírodní vědy, 1961, str. 21-34.
[7] S. D. Bedrosian: Formulas for the Number of Trees in a Network. IRE Trans. on Circuit Theory, Vol. CT-8, pp. 363-364, Sept. 1961.
[8] P. V. O’Neil: The Number of Trees in a Certain Network. presented at Meeting No. 604, Am. Math. Soc., Brooklyn, N.Y., Oct., 1963.
[9] S. D. Bedrosian: Generating Formulas for the Number of Trees in a Graph. Journal of The Franklin Institute, Vol. 277, Nr. 4, pp. 313-326, April 1964. | MR | Zbl
Cité par Sources :