The Chromatic Number of (P5, HVN)-free Graphs

被引：0
|
作者：
Xu, Yian [1 ]
机构：
[1] Southeast Univ, Sch Math, Nanjing 211189, Peoples R China
来源：
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES | 2024年 / 40卷 / 04期
基金：
中国国家自然科学基金;
关键词：
<italic>P</italic>5; HVN; chromatic number; clique number; BOUNDS;
D O I：
10.1007/s10255-024-1029-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let G be a graph. We use chi(G) and omega(G) to denote the chromatic number and clique number of G respectively. A P5 is a path on 5 vertices, and an HVN is a K4 together with one more vertex which is adjacent to exactly two vertices of K4. Combining with some known result, in this paper we show that if G is (P5, HVN)-free, then chi(G) <= max{min{16, omega(G) + 3}, omega(G) + 1}. This upper bound is almost sharp.
引用
收藏
页码：1098 / 1110
页数：13
相关论文
共 50 条
  • [31] (P5,diamond)-free graphs revisited:: structure and linear time optimization
    Brandstädt, A
    DISCRETE APPLIED MATHEMATICS, 2004, 138 (1-2) : 13 - 27
  • [32] Total chromatic number of unichord-free graphs
    Machado, R. C. S.
    de Figueiredo, C. M. H.
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (16) : 1851 - 1864
  • [33] Chromatic Number of ISK4-Free Graphs
    Ngoc Khang Le
    Graphs and Combinatorics, 2017, 33 : 1635 - 1646
  • [34] Chromatic Number of ISK4-Free Graphs
    Le, Ngoc Khang
    GRAPHS AND COMBINATORICS, 2017, 33 (06) : 1635 - 1646
  • [35] BOUNDING THE FRACTIONAL CHROMATIC NUMBER OF KΔ-FREE GRAPHS
    Edwards, Katherine
    King, Andrew D.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (02) : 1184 - 1208
  • [36] On the chromatic number of a family of odd hole free graphs
    Song, Jialei
    Xu, Baogang
    arXiv, 2021,
  • [37] The Chromatic Number of the Product of 5-Chromatic Graphs can be 4
    Claude Tardif
    Combinatorica, 2023, 43 : 1067 - 1073
  • [38] The Chromatic Number of the Product of 5-Chromatic Graphs can be 4
    Tardif, Claude
    COMBINATORICA, 2023, 43 (06) : 1067 - 1073
  • [39] THE CHROMATIC NUMBER OF (P6, C4, diamond)-FREE GRAPHS
    Lan, Kaiyang
    Zhou, Yidong
    Liu, Feng
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2023, 108 (01) : 1 - 10
  • [40] On the chromatic number of graphs
    Butenko, S
    Festa, P
    Pardalos, PM
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2001, 109 (01) : 51 - 67
12345