Geodesic
The Reconstruction of a Connected Graph from its Spanning Trees
Mathematica slovaca, Tome 24 (1974) no. 4, pp. 307-314
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C05, 05C99 
@article{MASLO_1974_24_4_a2,
     author = {Sedl\'a\v{c}ek, Ji\v{r}{\'\i}},
     title = {The {Reconstruction} of a {Connected} {Graph} from its {Spanning} {Trees}},
     journal = {Mathematica slovaca},
     pages = {307--314},
     year = {1974},
     volume = {24},
     number = {4},
     mrnumber = {0412046},
     zbl = {0294.05102},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1974_24_4_a2/}
}
TY  - JOUR
AU  - Sedláček, Jiří
TI  - The Reconstruction of a Connected Graph from its Spanning Trees
JO  - Mathematica slovaca
PY  - 1974
SP  - 307
EP  - 314
VL  - 24
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MASLO_1974_24_4_a2/
LA  - en
ID  - MASLO_1974_24_4_a2
ER  - 
%0 Journal Article
%A Sedláček, Jiří
%T The Reconstruction of a Connected Graph from its Spanning Trees
%J Mathematica slovaca
%D 1974
%P 307-314
%V 24
%N 4
%U http://geodesic.mathdoc.fr/item/MASLO_1974_24_4_a2/
%G en
%F MASLO_1974_24_4_a2
Sedláček, Jiří. The Reconstruction of a Connected Graph from its Spanning Trees. Mathematica slovaca, Tome 24 (1974) no. 4, pp. 307-314. http://geodesic.mathdoc.fr/item/MASLO_1974_24_4_a2/

[1] FISHER J.: A Counterexample to the Countable Vеrsion of a Conjесture of Ulam. J. Combinatorial Theory 7, 1969, 364-365. | MR

[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

[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

[4] KELLY P. J.: A Congruеnce Tһеorеm fоr Trееs. Pacific J. Math., 1957, 961-968. | MR

[5] SEDLÁČEK Ј.: Luсasova čísla v tеоrii grafu. In: Matematika. Universita Karlova, 1970, 111-115.

[6] SEDLÁČEK Ј.: O kоstráсh konečných grafu. Čas. Pěstov. Mat. 91. 1966, 221-227.

[7] TUTTE W. T.: Conneсtivitу in Graphs. Oxfоrd Univеrsity Press 1966. | MR

[8] ULAM S. M.: A Cоlleсtiоn of Matһematiсal Prоblems. Nеw Yоrk 1966.

[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