Previous |  Up |  Next

Article

Title: Regular graphs and their spanning trees (English)
Author: Sedláček, Jiří
Language: English
Journal: Časopis pro pěstování matematiky
ISSN: 0528-2195
Volume: 95
Issue: 4
Year: 1970
Pages: 420-426
.
Category: math
.
MSC: 05-45
idZBL: Zbl 0201.56902
idMR: MR0282876
DOI: 10.21136/CPM.1970.108329
.
Date available: 2009-09-23T08:14:15Z
Last updated: 2020-07-28
Stable URL: http://hdl.handle.net/10338.dmlcz/108329
.
Reference: [1] J. W. Moon: Various proofs of Cayley's formula for counting trees.A seminar on graph theory (F. Harary, ed.) 70-78. MR 0214515
Reference: [2] J. Sedláček: Finite graphs and their spanning trees.Časopis Pěst. Mat. 92 (1967), 338-342. MR 0221969
Reference: [3] J. Sedláček: On the spanning trees of finite graphs.Časopis Pӗst. Mat. 91 (1966), 221-227. MR 0195763
Reference: [4] J. Sedláček: On the number of spanning trees of finite graphs.Časopis Pést. Mat. 94 (1969), 217-221. MR 0250931
.

Files

Files Size Format View
CasPestMat_095-1970-4_12.pdf 750.6Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo