Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles

被引：0
|
作者：
Liu, Zhengjiao [1 ]
Wang, Tao [2 ]
Yang, Xiaojing [1 ]
机构：
[1] Henan Univ, Sch Math & Stat, Kaifeng 475004, Peoples R China
[2] Henan Univ, Ctr Appl Math, Kaifeng 475004, Peoples R China
来源：
DISCRETE APPLIED MATHEMATICS | 2024年 / 358卷
基金：
中国国家自然科学基金;
关键词：
Planar graph; (I; F)-partition; Weak degeneracy; Transversal;
D O I：
10.1016/j.dam.2024.07.003
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A graph is (I,F)-partitionableif its vertex set can be partitioned into two parts suchthat one partIis an independent set, and the otherFinduces a forest. A graphisk-degenerateif every subgraphHcontains a vertex of degree at mostkinH.Bernshteyn and Lee defined a generalization ofk-degenerate graphs, which is calledweakly k-degenerate. In this paper, we show that planar graphs without 4-, 7-, 9-cycles,and 5-cycles normally adjacent to 3-cycles are both (I,F)-partitionable and weakly2-degenerate. (c) 2024ElsevierB.V.Allrightsarereserved,includingthosefortextanddatamining,AItraining,andsimilartechnologies.
引用
收藏
页码：158 / 166
页数：9
相关论文
共 50 条
  • [21] Planar graphs without normally adjacent short cycles
    Lu, Fangyao
    Rao, Mengjiao
    Wang, Qianqian
    Wang, Tao
    DISCRETE MATHEMATICS, 2022, 345 (10)
  • [22] DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4-or 5-Cycles
    Yang, Fan
    Li, Xiangwen
    Huang, Ziwen
    MATHEMATICS, 2025, 13 (02)
  • [23] Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
    Li, Rui
    Xu, Baogang
    DISCRETE MATHEMATICS, 2011, 311 (20) : 2158 - 2163
  • [24] EXTREMAL GRAPHS WITHOUT 3-CYCLES OR 4-CYCLES
    GARNICK, DK
    KWONG, YHH
    LAZEBNIK, F
    JOURNAL OF GRAPH THEORY, 1993, 17 (05) : 633 - 645
  • [25] TOTAL COLORINGS OF PLANAR GRAPHS WITH MAXIMUM DEGREE AT LEAST 7 AND WITHOUT ADJACENT 5-CYCLES
    Tan, Xiang
    BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, 2016, 53 (01) : 139 - 151
  • [26] Planar graphs with no incident triangles and no 4- or 5-cycles are (7 : 2)-colorable
    Rolek, Martin
    Scemama, Paul
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2025, 91 : 32 - 40
  • [27] Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
    Cho, Eun-Kyung
    Choi, Ilkyoo
    Park, Boram
    DISCRETE MATHEMATICS, 2021, 344 (01)
  • [28] Linear 2-arboricity of planar graphs with 5-cycles not adjacent to short cycles
    Chen, Hong-Yu
    Zhang, Li
    UTILITAS MATHEMATICA, 2019, 110 : 117 - 130
  • [29] Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
    Sittitrai, Pongpat
    Nakprasit, Kittikorn
    DISCRETE MATHEMATICS, 2018, 341 (08) : 2142 - 2150
  • [30] 2-Distance coloring of planar graphs without adjacent 5-cycles
    Yuehua Bu
    Zewei Zhang
    Hongguo Zhu
    Journal of Combinatorial Optimization, 2023, 45
12345