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
关键词
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 条
  • [41] Maximum bipartite subgraphs of cubic triangle-free planar graphs
    Cui, Qing
    Wang, Jian
    DISCRETE MATHEMATICS, 2009, 309 (05) : 1091 - 1111
  • [42] Triangle-free equimatchable graphs
    Buyukcolak, Yasemin
    Ozkan, Sibel
    Gozupek, Didem
    JOURNAL OF GRAPH THEORY, 2022, 99 (03) : 461 - 484
  • [43] Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs
    Pascal Ochem
    Alexandre Pinlou
    Graphs and Combinatorics, 2014, 30 : 439 - 453
  • [44] On triangle-free random graphs
    Luczak, T
    RANDOM STRUCTURES & ALGORITHMS, 2000, 16 (03) : 260 - 276
  • [45] On triangle-free projective graphs
    Hazan, S
    ALGEBRA UNIVERSALIS, 1996, 35 (02) : 185 - 196
  • [46] On the evolution of triangle-free graphs
    Steger, A
    COMBINATORICS PROBABILITY & COMPUTING, 2005, 14 (1-2): : 211 - 224
  • [47] ON MAXIMAL TRIANGLE-FREE GRAPHS
    ERDOS, P
    HOLZMAN, R
    JOURNAL OF GRAPH THEORY, 1994, 18 (06) : 585 - 594
  • [48] Triangle-free polyconvex graphs
    Isaksen, DC
    Robinson, B
    ARS COMBINATORIA, 2002, 64 : 259 - 263
  • [49] Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs
    Ochem, Pascal
    Pinlou, Alexandre
    GRAPHS AND COMBINATORICS, 2014, 30 (02) : 439 - 453
  • [50] CYCLES IN TRIANGLE-FREE GRAPHS
    Li, Xiaojuan
    Wei, Bing
    Zhu, Yongjin
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2011, 3 (03) : 343 - 356