Upper Bound of Chromatic Number for { 3K1, K1+C4}-free Graphs
WANG Xiao
Abstract：Gyárfás improves the conception of perfect graphs,and gives the upper bound with f (ω) on chromatic number of graphs. By analyzing of the structural characterization of{3K1, K1+C4}-free graphs,the upper bound,with linear function in term of clique number,on chromatic number of { 3K1, K1+C4}-free graphs is obtained. This result improves Choudum etl.'s result for these graphs.
Keywords：chromatic numberinduced subgraphclique number
Publication Date：2019-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：3( 513-515 )