共 50 条
On the structure and clique-width of ( 4 K 1 , C 4 , C 6 , C 7 )-free graphs
被引:1
作者:
Penev, Irena
[1
]
机构:
[1] Charles Univ IUUK, Comp Sci Inst, Malostranske 25, Prague 11800, Czech Republic
关键词:
clique-width;
even-hole-free graphs;
graph algorithms;
graph coloring;
graph structure;
HOLE-FREE GRAPHS;
DECOMPOSITION;
CUTSETS;
D O I:
10.1002/jgt.22749
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We give a complete structural description of ( 4 K 1 , C 4 , C 6 , C 7 )-free graphs that do not contain a simplicial vertex, and we prove that such graphs have bounded clique-width. Together with the results of Foley et al., this implies that ( 4 K 1 , C 4 , C 6 )-free graphs that do not contain a simplicial vertex have bounded clique-width. Consequently, Graph Coloring can be solved in polynomial time for ( 4 K 1 , C 4 , C 6 )-free graphs, that is, for even-hole-free graphs of stability number at most three.
引用
收藏
页码:435 / 460
页数:26
相关论文
共 50 条