A new characterization of trivially perfect graphs

被引:2
|
作者
Rubio-Montiel, Christian [1 ]
机构
[1] Univ Nacl Autonoma Mexico, Inst Matemat, Ciudad Univ, Mexico City 04510, DF, Mexico
关键词
Perfect graphs; complete coloring; Grundy number; forbidden graph characterization;
D O I
10.5614/ejgta.2015.3.1.3
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A graph G is trivially perfect if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number) alpha(G) equals the number of (maximal) cliques m(G). We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.
引用
收藏
页码:22 / 26
页数:5
相关论文
共 50 条