Large induced forests in planar graphs with girth 4

被引：4
|
作者：
Dross, Francois [1 ]
Montassier, Mickael [1 ]
Pinlou, Alexandre [1 ]
机构：
[1] Univ Montpellier, LIRMM, 161 Rue Ada, F-34095 Montpellier 5, France
来源：
DISCRETE APPLIED MATHEMATICS | 2019年 / 254卷
关键词：
Planar graphs; Triangle-free planar graphs; Induced forests; Feedback vertex sets; Albertson-Berman conjecture;
D O I：
10.1016/j.dam.2018.06.029
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We give a new lower bound on the order of a largest induced forest in planar graphs with girth 4. We prove that a triangle-free planar graph of order n admits an induced forest of order at least 6n+7/11 , improving the lower bound of Salavatipour (2006). (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码：96 / 106
页数：11
相关论文
共 50 条
  • [31] Fractional DP-chromatic number of planar graphs of large girth
    Wu, Jianglin
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2022, 14 (02)
  • [32] n-Tuple coloring of planar graphs with large odd girth
    Klostermeyer, W
    Zhang, CQ
    GRAPHS AND COMBINATORICS, 2002, 18 (01) : 119 - 132
  • [33] (2+ε)-coloring of planar graphs with large odd-girth
    Klostermeyer, W
    Zhang, CQ
    JOURNAL OF GRAPH THEORY, 2000, 33 (02) : 109 - 119
  • [34] 4-Chromatic graphs with large odd girth
    Discrete Math, 1-3 (387):
  • [35] 4-CHROMATIC GRAPHS WITH LARGE ODD GIRTH
    VANNGOC, N
    TUZA, Z
    DISCRETE MATHEMATICS, 1995, 138 (1-3) : 387 - 392
  • [36] Colorings and girth of oriented planar graphs
    Nesetril, J
    Raspaud, A
    Sopena, E
    DISCRETE MATHEMATICS, 1997, 165 : 519 - 530
  • [37] Large induced forests in sparse graphs
    Alon, N
    Mubayi, D
    Thomas, R
    JOURNAL OF GRAPH THEORY, 2001, 38 (03) : 113 - 123
  • [38] On universal graphs for planar oriented graphs of a given girth
    Borodin, OV
    Kostochka, AV
    Nesetril, J
    Raspaud, A
    Sopena, E
    DISCRETE MATHEMATICS, 1998, 188 (1-3) : 73 - 85
  • [39] Acyclic 4-choosability of planar graphs with girth at least 5
    Montassier, Mickael
    Graph Theory in Paris: PROCEEDINGS OF A CONFERENCE IN MEMORY OF CALUDE BERGE, 2007, : 299 - 310
  • [40] Planar graphs with girth at least 5 are (3,4)-colorable
    Choi, Ilkyoo
    Yu, Gexin
    Zhang, Xia
    DISCRETE MATHEMATICS, 2019, 342 (12)
12345