Vertex-Critical (P5, chair)-Free Graphs

被引：0
|
作者：
Huang, Shenwei [1 ]
Li, Zeyu [2 ]
机构：
[1] College of Computer Science, Nankai University, Tianjin,300350, China
[2] Tianjin Key Laboratory of Network and Data Security Technology, Nankai University, Tianjin,300071, China
来源：
arXiv | 2023年
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Graph theory
引用
收藏
相关论文
共 50 条
  • [41] Improved bounds on the chromatic number of (P5, flag)-free graphs
    Char, Arnab
    Karthick, T.
    DISCRETE MATHEMATICS, 2023, 346 (09)
  • [42] Stable set and clique polytopes of (P5,gem)-free graphs
    De Simone, Caterina
    Mosca, Raffaele
    DISCRETE MATHEMATICS, 2007, 307 (22) : 2661 - 2670
  • [43] The computational complexity of weighted vertex coloring for {P5,K2,3,K2,3+}-free graphs
    Malyshev, D. S.
    Razvenskaya, O. O.
    Pardalos, P. M.
    OPTIMIZATION LETTERS, 2021, 15 (01) : 137 - 152
  • [44] (P5,diamond)-free graphs revisited:: structure and linear time optimization
    Brandstädt, A
    DISCRETE APPLIED MATHEMATICS, 2004, 138 (1-2) : 13 - 27
  • [45] Independent Feedback Vertex Set for P5-Free Graphs
    Bonamy, Marthe
    Dabrowski, Konrad K.
    Feghali, Carl
    Johnson, Matthew
    Paulusma, Daniel
    ALGORITHMICA, 2019, 81 (04) : 1342 - 1369
  • [46] k-Critical Graphs in P5-Free Graphs
    Cameron, Kathie
    Goedgebeur, Jan
    Huang, Shenwei
    Shi, Yongtang
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 411 - 422
  • [47] k-Critical graphs in P5-free graphs
    Cameron, Kathie
    Goedgebeur, Jan
    Huang, Shenwei
    Shi, Yongtang
    THEORETICAL COMPUTER SCIENCE, 2021, 864 : 80 - 91
  • [48] Vertex-Transitive Digraphs of Order p5 are Hamiltonian
    Zhang, Jun-Yang
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (01):
  • [49] Coloring (P5,gem) $({P}_{5},\text{gem})$-free graphs with Δ -1 ${\rm{\Delta }}-1$ colors
    Cranston, Daniel W.
    Lafayette, Hudson
    Rabern, Landon
    JOURNAL OF GRAPH THEORY, 2022, 101 (04) : 633 - 642
  • [50] On minimal imperfect graphs without induced P5
    Barré, V
    Fouquet, JL
    DISCRETE APPLIED MATHEMATICS, 1999, 94 (1-3) : 9 - 33
12345