| Title:
|
O kostrách konečných grafů (Czech) |
| Title:
|
On the spanning trees of finite graphs (English) |
| Author:
|
Sedláček, Jiří |
| Language:
|
Czech |
| Journal:
|
Časopis pro pěstování matematiky |
| ISSN:
|
0528-2195 |
| Volume:
|
91 |
| Issue:
|
2 |
| Year:
|
1966 |
| Pages:
|
221-227 |
| Summary lang:
|
English |
| Summary lang:
|
Russian |
| . |
| Category:
|
math |
| . |
| MSC:
|
05-45 |
| idZBL:
|
Zbl 0151.33304 |
| idMR:
|
MR0195763 |
| DOI:
|
10.21136/CPM.1966.108107 |
| . |
| Date available:
|
2009-09-23T07:47:12Z |
| Last updated:
|
2020-07-28 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/108107 |
| . |
| Reference:
|
[1] T. Austin: The enumeration of point labelled chromatic graphs and trees.Canad. J. Math. 12 (1960), 535-545. Zbl 0096.17802, MR 0139544 |
| Reference:
|
[2] C. Berge: Théorie des graphes et ses applications.Paris 1958 (ruský překlad od A. A. Zykova vyšel v Moskvě r. 1962). MR 0155312 |
| Reference:
|
[3] 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:
|
[4] C. St. J. A. Nash-Williams: Edge-disjoint spanning trees of finite graphs.J. London Math. Soc. 36 (1961), 445-450. Zbl 0102.38805, MR 0133253 |
| Reference:
|
[5] C. St. J. A. Nash-Williams: Decomposition of finite graphs into forests.J. London Math. Soc. 39 (1964), 12. Zbl 0119.38805, MR 0161333 |
| Reference:
|
[6] H. Sachs: Über selbstkomplementäre Graphen.Publ. Math. Debrecen 9 (1962), 270-288. Zbl 0119.18904, MR 0151953 |
| Reference:
|
[7] J. Sedláček: Kombinatorika v teorii a praxi (Úvod do teorie grafů).Nakladatelství ČSAV, Praha 1964. MR 0190035 |
| Reference:
|
[8] H. M. Trent: A note on the enumeration and listing of all possible trees in a connected linear graph.Proc. Math. Acad. Sci. USA 40 (1954), 1004-1007. Zbl 0055.42204, MR 0067466 |
| Reference:
|
[9] W. T. Tutte: On the problem of decomposing a graph into $n$ connected factors.J. London Math. Soc. 36 (1961), 221-230. Zbl 0096.38001, MR 0140438 |
| . |
