Finite graphs and their spanning trees
Časopis pro pěstování matematiky (1967)
- Volume: 092, Issue: 3, page 338-342
- ISSN: 0528-2195
Access Full Article
top
How to cite
topSedláček, Jiří. "Finite graphs and their spanning trees." Časopis pro pěstování matematiky 092.3 (1967): 338-342. <http://eudml.org/doc/19232>.
@article{Sedláček1967,
author = {Sedláček, Jiří},
journal = {Časopis pro pěstování matematiky},
keywords = {topology},
language = {eng},
number = {3},
pages = {338-342},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Finite graphs and their spanning trees},
url = {http://eudml.org/doc/19232},
volume = {092},
year = {1967},
}
TY - JOUR
AU - Sedláček, Jiří
TI - Finite graphs and their spanning trees
JO - Časopis pro pěstování matematiky
PY - 1967
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 092
IS - 3
SP - 338
EP - 342
LA - eng
KW - topology
UR - http://eudml.org/doc/19232
ER -
References
top- C. Berge, Théorie des graphes еt sеs applications, Paris 1958. (1958)
- L. E. Clarke, On Caylеy's formula for counting trееs, J. London Math. Soc. 33 (1958), 471-474. (1958) MR0100854
- M. Fiedler J. Sedláček, O W-basích oriеntovaných grafů. (On W-basеs of diгеctеd graphs.), Časopis pro pěstování matеmatiky 83 (1958), 214- 225. (1958) MR0097071
- T. Gallai, Elеmеntarе Rеlationеn bеzüglich dеr Gliеdеr und trеnnеndеn Punktе von Graphеn, Publ. math. Inst. Hungar. Acad. Sci., Sеr. A, 9 (1964), 235-236. (1964) MR0169231
- O. Ore, Thеory of graphs, Providеncе 1962. (1962)
- J. Sedláček, Kombinatorika v tеoгii a praxi (Úvod do tеoriе grafů), Praha 1964. (1964)
- J. Sedláček, O kostrách konеčných grafů. (On thе spanning trееs of finitе graphs, Časopis pro pěstování matеmatiky 91 (1966), 221-227. (1966)
Citations in EuDML Documents
topNotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.