Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T08:32:38.619Z Has data issue: false hasContentIssue false
  • English
  • Français

Lower Bounds For Induced Forests in Cubic Graphs

Published online by Cambridge University Press:  20 November 2018

J. A. Bondy,
Glenn Hopkins and
William Staton
J. A. Bondy
Affiliation:
Faculty of Mathematics University of Waterloo Waterloo, Ontario, N2L 3G1
Glenn Hopkins
Affiliation:
Faculty of Mathematics University of Waterloo Waterloo, Ontario, N2L 3G1
William Staton
Affiliation:
Department of Mathematics University of Mississippi University, Mississippi, 38677
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

If G is a connected cubic graph with ρ vertices, ρ > 4, then G has a vertex-induced forest containing at least (5ρ - 2)/8 vertices. In case G is triangle-free, the lower bound is improved to (2ρ — l)/3. Examples are given to show that no such lower bound is possible for vertex-induced trees.

Keywords

05

Information

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 30 , Issue 2 , 01 June 1987, pp. 193 - 199
Copyright
Copyright © Canadian Mathematical Society 1987

References

1. Behzad, M., Chartrand, G., and Lesniak-Foster, L., Graphs and Digraphs (Wadsworth, 1979), p. 10.Google Scholar
2. Jaegar, F., On vertex-induced forests in cubic graphs, Proc. 5th S.-E. Conf. Combinatorics, Graph Theory, and Computing (1974) 501–512.Google Scholar
3. Payan, C. and Sakarovitch, M., Ensembles cycliquement stables et graphes cubiques, Colloque sur la théorie des Graphes (Paris, 1974) Cahiers Centre Études Recherche Opér. 17 (1975) 319–343.Google Scholar
4. Staton, W., Induced forests in cubic graphs, Discrete Mathematics 49 (1984) 175-178.Google Scholar