An improved bound on the largest induced forests for triangle-free planar graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

An improved bound on the largest induced forests for triangle-free planar graphs

Abstract

We proved that every planar triangle-free graph of order n has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of Salavatipour (2006). We also pose some questions regarding planar graphs of higher girth.
Fichier principal
Vignette du fichier
1323-4944-2-PB.pdf (157.73 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...

Dates and versions

hal-00990440 , version 1 (12-06-2014)

Identifiers

Cite

Lukasz Kowalik, Borut Luzar, Riste Skrekovski. An improved bound on the largest induced forests for triangle-free planar graphs. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 1 (1), pp.87-100. ⟨10.46298/dmtcs.487⟩. ⟨hal-00990440⟩

Collections

TDS-MACS
78 View
1060 Download

Altmetric

Share

Gmail Facebook X LinkedIn More