The Chromatic Number of(P_(5),HVN)-free Graphs  

作　　者：Yian XU 

机构地区：[1]School of Mathematics,Southeast University,Nanjing 211189,China

出　　处：《Acta Mathematicae Applicatae Sinica》2024年第4期1098-1110,共13页应用数学学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(No.12101117);Natural Science Foundation of Jiangsu Province(No.BK20200344)。

摘　　要：Let G be a graph.We useχ(G)andω(G)to denote the chromatic number and clique number of G respectively.A P_(5)is a path on 5 vertices,and an HVN is a K_(4)together with one more vertex which is adjacent to exactly two vertices of K_(4).Combining with some known result,in this paper we show that if G is(P_(5),HVN)-free,thenχ(G)≤max{min{16,ω(G)+3},ω(G)+1}.This upper bound is almost sharp.

关 键 词：P_(5) HVN chromatic number clique number 

分 类 号：O157.5[理学—数学]