| Title:
|
Ještě o kostrách souvislých grafů (Czech) |
| Title:
|
More on spanning trees of connected graphs (English) |
| Author:
|
Sedláček, Jiří |
| Language:
|
Czech |
| Journal:
|
Časopis pro pěstování matematiky |
| ISSN:
|
0528-2195 |
| Volume:
|
104 |
| Issue:
|
1 |
| Year:
|
1979 |
| Pages:
|
75-85 |
| Summary lang:
|
English |
| . |
| Category:
|
math |
| . |
| MSC:
|
05C05 |
| idZBL:
|
Zbl 0403.05030 |
| idMR:
|
MR523574 |
| DOI:
|
10.21136/CPM.1979.118001 |
| . |
| Date available:
|
2009-09-23T08:57:41Z |
| Last updated:
|
2020-07-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/118001 |
| . |
| Reference:
|
[1] J. A. Bondy R. L. Hemminger: Graph reconstruction - a survey.Department of Combinatorics and Optimization, Research Report CORR 76-49, December 1976. MR 0480189 |
| Reference:
|
[2] R. D. Boyle: .Soukromé sdělení (1976). Zbl 0344.73037 |
| Reference:
|
[3] F. C. Bussemaker S. Čobeljič L. M. Cvetkovič J. J. Seidel: Computer investigation of cubic graphs.Technological University Eindhoven, The Netherlands, Department of Mathematics, January 1976. |
| Reference:
|
[4] M. Fiedler J. Sedláček: O W-basích orientovaných grafů.Časopis pro pěstování matematiky 83 (1958), 214-225. MR 0097071 |
| Reference:
|
[5] R. Fischer: Über Graphen mit isomorphen Gerüsten.Monatshefte für Mathematik 77 (1973), 24-30. Zbl 0253.05105, MR 0337697 |
| Reference:
|
[6] L. Friess: Graphen, worin je zwei Gerüste isomorph sind.Math. Ann. 204 (1973), 65-71. Zbl 0253.05104, MR 0366744 |
| Reference:
|
[7] F. Harary: Graph theory.Addison-Wesley, Reading, Mass., 1969. Zbl 0196.27202, MR 0256911 |
| Reference:
|
[8] B. L. Hartnell: A note on graphs having exactly n isomorphism classes of spanning trees.Scientific Report No 77, Winnipeg, July 1974. |
| Reference:
|
[9] B. L. Hartnell: On graphs with exactly two isomorfism classes of spanning trees.Utilitas Mathematica 6 (1974), 121-137. MR 0360324 |
| Reference:
|
[10] B. L. Hartnell E. R. Meyer: On unicyclic graphs having exactly three isomorphism classes of spanning trees.Scientific Report No 81, Winnipeg, July 1975. |
| Reference:
|
[11] J. W. Moon: Counting labelled trees.Canadian Mathematical Congress 1970. Zbl 0214.23204, MR 0274333 |
| Reference:
|
[12] J. Sedláček: O kostrách konečných grafů.Časopis pro pěstování matematiky 91 (1966), 221-227. MR 0195763 |
| Reference:
|
[13] J. Sedláček: On the number of spanning trees of finite graphs.Časopis pro pěstování matematiky 94 (1969), 217-221. MR 0250931 |
| Reference:
|
[14] J. Sedláček: On the skeletons of a graph or digraph.Combinatorial Structures and their Applications, Gordon and Breach, New York 1970, 387-391. |
| Reference:
|
[15] J. Sedláček: Regular graphs and their spanning trees.Časopis pro pěstování matematiky 95 (1970), 420-425. MR 0282876 |
| Reference:
|
[16] J. Sedláček: Some properties of trees.Recent Advances in Graph Theory, Proceedings of the Symposium held in Prague, June 1974, Academia Prague 1975, 467-470. MR 0384583 |
| Reference:
|
[17] J. Sedláček: The reconstruction of a connected graph from its spanning trees.Matematický časopis 24 (1974), 307-314. MR 0412046 |
| Reference:
|
[18] J. Sedláček: Úvod do teorie grafů.Praha 1977. MR 0491274 |
| Reference:
|
[19] K. Wagner: Graphentheorie.Mannheim-Wien-Zürich 1970. Zbl 0195.54103, MR 0282850 |
| Reference:
|
[20] R. J. Wilson: Introduction to graph theory.Edinburgh 1972. Zbl 0249.05101, MR 0357175 |
| Reference:
|
[21] B. Zelinka: Grafy, jejichž všechny kostry jsou spolu izomorfní.Časopis pro pěstování matematiky 96 (1971), 33-40. MR 0286711 |
| Reference:
|
[22] Ф. Харари Э. Палмер: Перечисление графов.Москва 1977. Zbl 1225.01071 |
| . |
