Maximum Induced Linear Forests in Outerplanar Graphs

Maximum Induced Linear Forests in Outerplanar Graphs

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

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics 2004-03, Vol.20 (1), p.121-129
1. Verfasser: Pelsmajer, Michael J.
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorics
Graphs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Every simple n-vertex outerplanar graph has an induced subgraph with at least vertices that is a linear forest, and this bound is sharp. [PUBLICATION ABSTRACT]
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-003-0528-x