计算机与数字工程2019，Vol.47Issue(3)：513-515,3.DOI:10.3969/j.issn.1672-9722.2019.03.005
不含3K1和 K1+C4为导出子图的图色数上界
Upper Bound of Chromatic Number for { 3K1, K1+C4}-free Graphs
摘要
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.关键词
色数/导出子图/团数Key words
chromatic number/induced subgraph/clique number分类
数理科学引用本文复制引用
王晓..不含3K1和 K1+C4为导出子图的图色数上界[J].计算机与数字工程,2019,47(3):513-515,3.基金项目
陕西省教育厅自然科学专项基金项目(编号:16JK1243)资助. （编号:16JK1243）
