Abstract
Let G be a connected simple graph. We study the maximal order of a subisce T ⊂ G with a given maximum degree Δ T . We obtained conditions on the degree sequence of a graph which are similar to that of Bondy and Las-Vergnas on the Hamilton cycle, and strengthen early results of Win |10| and the authors [4].
This is a preview of subscription content, log in via an institution to check access.
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:
J.C. Bermond, Hamiltonian graphs, in Selected Topics in Graph Theory, ed. L. Bieneke and R.J. Wilson, Academic Press, London (1978), 127–167.
J.A. Bondy, Large cycles in graphs, Discrete Math. 1 (1971), 121–132.
Y.Caro, I.Krasikov and Y.Roditty, Spanning trees and some edge-reconstructible graphs, Ars Combinatoria 20-A (1985), 109–118.
Y.Caro, I.Krasikov and Y.Roditty, On the largest subtrec of a given maximumdegree in a connected graph, submitted.
V. Chvatal and P. Erdos, A note on hamiltonian circuits, Discrete Math. 2 (1972), 111–113.
M. Las Vergnas, Sur une propriete des arbores maximaux dans un graphe, Acad. Sci. Paris. Ser A-B 272 (1971) 1297–1300.
V. Neumann-Lara and E. Rivera-Campo, Spanning trees with bounded degrees, Combinatorica, to appear.
Ore, Note on Hamilton circuits, Amer. Math. Monthly 67 (1960) 55.
L. Posa, A theorem concerning hamilton lines, Magyar Tud. Akad. Math. Kutato Int. Kozl. 7 (1962) 225–226.
S. Win, Existenz von Gerusten mit Vorgeschriebenem Maximalgrad in Graphen, Abhandlungen aus dem Mathematichen Seminar der Univcrsitat Hamburg, 43 (1975), 263–267.
S. Win, On a connection between the existence of k—trees and the toughness of a graph, Graphs and Combinatorics, vol. 5, 2 (1989) 201–205
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Physica-Verlag Heidelberg
About this chapter
Cite this chapter
Krasikov, I., Roditty, Y. (1990). A Las-Vergnas Type Theorem for Trees. In: Bodendiek, R., Henn, R. (eds) Topics in Combinatorics and Graph Theory. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-46908-4_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-46908-4_51
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-642-46910-7
Online ISBN: 978-3-642-46908-4
eBook Packages: Springer Book Archive