Maximum Induced Linear Forests in Outerplanar Graphs | Graphs and Combinatorics Skip to main content
Springer Nature Link
Log in

Maximum Induced Linear Forests in Outerplanar Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract.

Every simple n–vertex outerplanar graph has an induced subgraph with at least vertices that is a linear forest, and this bound is sharp.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Acknowledgments.

The author wishes to thank Douglas B. West for vastly improving the exposition of this paper. The author would also like to thank Radhika Ramamurthi for useful discussions.

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Illinois Institute of Technology, Chicago IL, 60616, USA

    Michael J. Pelsmajer

Authors
  1. Michael J. Pelsmajer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael J. Pelsmajer.

Additional information

Work done while at the Department of Mathematics, University of Illinois, Urbana, IL 61801, USA

Final version received: June 5, 2003

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pelsmajer, M. Maximum Induced Linear Forests in Outerplanar Graphs. Graphs and Combinatorics 20, 121–129 (2004). https://doi.org/10.1007/s00373-003-0528-x

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-003-0528-x

Keywords

Search

Navigation