Previous |  Up |  Next

Article

Title: The Reconstruction of a Connected Graph from its Spanning Trees (English)
Author: Sedláček, Jiří
Language: English
Journal: Matematický časopis
ISSN: 0025-5173
Volume: 24
Issue: 4
Year: 1974
Pages: 307-314
.
Category: math
.
MSC: 05C05
MSC: 05C99
idZBL: Zbl 0294.05102
idMR: MR0412046
.
Date available: 2009-09-25T08:32:34Z
Last updated: 2012-07-31
Stable URL: http://hdl.handle.net/10338.dmlcz/126560
.
Reference: [1] FISHER J.: A Counterexample to the Countable Vеrsion of a Conjесture of Ulam.J. Combinatorial Theory 7, 1969, 364-365. MR 0262102
Reference: [2] FISHER J., GRAHAM R. L., HARARY F.: A Simplеr Countеrеxample to tһе Rеconstruction Conjеcturе for Dеnumеrablе Graphs.Ј. Comһinatoпal Theory Ser. B 12, 1972, 203-204. MR 0295946
Reference: [3] HARARY F.: On thе Recоnstгuctiоn of a Graph from a Collеction оf Subgraphs.In: Tһеоry of Graphs and Its Applications (M. Fiedlеr, ed.). Praha 1964, 47-52. MR 0175111
Reference: [4] KELLY P. J.: A Congruеnce Tһеorеm fоr Trееs.Pacific J. Math., 1957, 961-968. MR 0087949
Reference: [5] SEDLÁČEK Ј.: Luсasova čísla v tеоrii grafu.In: Matematika. Universita Karlova, 1970, 111-115.
Reference: [6] SEDLÁČEK Ј.: O kоstráсh konečných grafu.Čas. Pěstov. Mat. 91. 1966, 221-227.
Reference: [7] TUTTE W. T.: Conneсtivitу in Graphs.Oxfоrd Univеrsity Press 1966. MR 0210617
Reference: [8] ULAM S. M.: A Cоlleсtiоn of Matһematiсal Prоblems.Nеw Yоrk 1966.
Reference: [9] ZELINKA B.: Grafу, jejiсhž všесhnу kоstrу jsоu spоlu isоmorfní.Čas. Pěstov. Mat. 96, 1971, 33-40. MR 0286711
.

Files

Files Size Format View
MathSlov_24-1974-4_3.pdf 966.7Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo