Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Bollobás, On graphs with at most three independent paths connecting any two vertices, Studia Sci. Math. Hung. 1 (1966), 137–140.
B. Bollobás, Cycles modulo k, to appear.
B. Bollobás, Semi-topological configurations, to appear.
B. Bollobás, and P. Erdös, On extremal problems in graph theory (in Hungarian), Mat. Lapok 13 (1962) 143–152.
P. Erdös, Problem in 3 of Schweitzer competition, Soltn by P. Bartfai, Mat. Lapok 11 (1960) 175–176.
P. Erdös, Some recent problems and results in graph theory, Proc. Seventh Southeastern Comb. Conf., to appear.
J. L. Leonard, On a conjecture of Bollobás and Erdös, Per. Math. Hung. 3 (1973) 281–284.
W. Mader, Ein Extremalproblem des Zusammenhaugs von Graphen, Math. Z. 131 (1973) 223–231.
W. Mader. Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homeomorph sind, Math. Nachr. 53 (1972) 145–150.
C. St. J. A. Nash-Williams, Edge-disjoint spanning trees in finite graphs, J. Lond. Math. Soc. 36 (1961) 445–450.
L. Pósa, Problem No. 127 (in Hungarian), Mat. Lapok 12 (1961) 254, Soltn by J. Czipszer, 14 (1963) 373.
B. A. Sørensen and C. Thomassen, On K-rails in graphs, J. Comb. Theory 17 (1974) 143–159.
W. T. Tutte, On the problem of decomposing the graph into n connected factors, J. Lond. Math. Soc. 36 (1961) 221–230.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bollobás, B. (1978). Cycles and semi-topological configurations. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070365
Download citation
DOI: https://doi.org/10.1007/BFb0070365
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08666-6
Online ISBN: 978-3-540-35912-8
eBook Packages: Springer Book Archive