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 条
  • [41] Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
    Huang, Danjun
    Zhang, Xiaoxiu
    Wang, Weifan
    Finbow, Stephen
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020, 12 (04)
  • [42] TOTAL COLORINGS OF EMBEDDED GRAPHS WITH NO 3-CYCLES ADJACENT TO 4-CYCLES
    Wang, Bing
    Wu, Jian-Liang
    Sun, Lin
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (04) : 977 - 989
  • [43] DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6,7,8}
    Liu, Runrun
    Loeb, Sarah
    Rolek, Martin
    Yin, Yuxue
    Yu, Gexin
    GRAPHS AND COMBINATORICS, 2019, 35 (03) : 695 - 705
  • [44] Planar graphs with the maximum number of induced 4-cycles or 5-cycles
    Savery, Michael
    arXiv, 2021,
  • [45] The r-dynamic chromatic number of planar graphs without 4-,5-cycles
    Yang, Ruiying
    Bu, Yuehua
    Zhu, Junlei
    Zhu, Hongguo
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (01)
  • [46] Planar Graphs with the Maximum Number of Induced 4-Cycles or 5-Cycles
    Savery, Michael
    GRAPHS AND COMBINATORICS, 2024, 40 (03)
  • [47] The r-dynamic chromatic number of planar graphs without 4-,5-cycles
    Ruiying Yang
    Yuehua Bu
    Junlei Zhu
    Hongguo Zhu
    Journal of Combinatorial Optimization, 2023, 45
  • [48] Planar graphs without intersecting 5-cycles are 4-choosable
    Hu, Dai-Qiang
    Wu, Jian-Liang
    DISCRETE MATHEMATICS, 2017, 340 (08) : 1788 - 1792
  • [49] List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
    Chen, Min
    Huang, Li
    Wang, Weifan
    DISCRETE MATHEMATICS, 2016, 339 (10) : 2526 - 2535
  • [50] Linear 2-Arboricity of Planar Graphs with Neither 3-Cycles Nor Adjacent 4-Cycles
    Hong-Xia Niu
    Jian-Sheng Cai
    Graphs and Combinatorics, 2013, 29 : 661 - 667
12345