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

被引：1
|
作者：
Kowalik, Lukasz [1 ]
Luzar, Borut [2 ]
Skrekovski, Riste [2 ]
机构：
[1] Warsaw Univ, Inst Informat, PL-02097 Warsaw, Poland
[2] Inst Math Phys & Mech, Ljubljana 1111, Slovenia
来源：
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE | 2010年 / 12卷 / 01期
关键词：
Induced forest; Forest number; Decycling number; INDUCED TREES;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：29 / 42
页数：14
相关论文
共 50 条
12345