More on spanning trees of connected graphs
Časopis pro pěstování matematiky (1979)
- Volume: 104, Issue: 1, page 75-85
- ISSN: 0528-2195
Access Full Article
top
How to cite
topSedláček, Jiří. "Ještě o kostrách souvislých grafů." Časopis pro pěstování matematiky 104.1 (1979): 75-85. <http://eudml.org/doc/21367>.
@article{Sedláček1979,
author = {Sedláček, Jiří},
journal = {Časopis pro pěstování matematiky},
keywords = {Spanning Trees; Connected Graphs},
language = {cze},
number = {1},
pages = {75-85},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Ještě o kostrách souvislých grafů},
url = {http://eudml.org/doc/21367},
volume = {104},
year = {1979},
}
TY - JOUR
AU - Sedláček, Jiří
TI - Ještě o kostrách souvislých grafů
JO - Časopis pro pěstování matematiky
PY - 1979
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 104
IS - 1
SP - 75
EP - 85
LA - cze
KW - Spanning Trees; Connected Graphs
UR - http://eudml.org/doc/21367
ER -
References
top- J. A. Bondy R. L. Hemminger, Graph reconstruction - a survey, Department of Combinatorics and Optimization, Research Report CORR 76-49, December 1976. (1976) MR0480189
- R. D. Boyle, [unknown], Soukromé sdělení (1976). (1976) Zbl0344.73037
- 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. (1976)
- M. Fiedler J. Sedláček, O W-basích orientovaných grafů, Časopis pro pěstování matematiky 83 (1958), 214-225. (1958) MR0097071
- R. Fischer, Über Graphen mit isomorphen Gerüsten, Monatshefte für Mathematik 77 (1973), 24-30. (1973) Zbl0253.05105MR0337697
- L. Friess, Graphen, worin je zwei Gerüste isomorph sind, Math. Ann. 204 (1973), 65-71. (1973) Zbl0253.05104MR0366744
- F. Harary, Graph theory, Addison-Wesley, Reading, Mass., 1969. (1969) Zbl0196.27202MR0256911
- B. L. Hartnell, A note on graphs having exactly n isomorphism classes of spanning trees, Scientific Report No 77, Winnipeg, July 1974. (1974)
- B. L. Hartnell, On graphs with exactly two isomorfism classes of spanning trees, Utilitas Mathematica 6 (1974), 121-137. (1974) MR0360324
- B. L. Hartnell E. R. Meyer, On unicyclic graphs having exactly three isomorphism classes of spanning trees, Scientific Report No 81, Winnipeg, July 1975. (1975)
- J. W. Moon, Counting labelled trees, Canadian Mathematical Congress 1970. (1970) Zbl0214.23204MR0274333
- J. Sedláček, O kostrách konečných grafů, Časopis pro pěstování matematiky 91 (1966), 221-227. (1966) MR0195763
- J. Sedláček, On the number of spanning trees of finite graphs, Časopis pro pěstování matematiky 94 (1969), 217-221. (1969) MR0250931
- J. Sedláček, On the skeletons of a graph or digraph, Combinatorial Structures and their Applications, Gordon and Breach, New York 1970, 387-391. (1970)
- J. Sedláček, Regular graphs and their spanning trees, Časopis pro pěstování matematiky 95 (1970), 420-425. (1970) MR0282876
- 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. (1974) MR0384583
- J. Sedláček, The reconstruction of a connected graph from its spanning trees, Matematický časopis 24 (1974), 307-314. (1974) MR0412046
- J. Sedláček, Úvod do teorie grafů, Praha 1977. (1977) MR0491274
- K. Wagner, Graphentheorie, Mannheim-Wien-Zürich 1970. (1970) Zbl0195.54103MR0282850
- R. J. Wilson, Introduction to graph theory, Edinburgh 1972. (1972) Zbl0249.05101MR0357175
- B. Zelinka, Grafy, jejichž všechny kostry jsou spolu izomorfní, Časopis pro pěstování matematiky 96 (1971), 33-40. (1971) MR0286711
- Ф. Харари Э. Палмер, Перечисление графов, Москва 1977. (1977) Zbl1225.01071
NotesEmbed ?
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.