STRONGLY PERFECT INFINITE-GRAPHS

被引：0
|
作者：
AHARONI, R [1 ]
LOEBL, M [1 ]
机构：
[1] CHARLES UNIV,DEPT APPL MATH,CR-11800 PRAGUE,CZECH REPUBLIC
来源：
ISRAEL JOURNAL OF MATHEMATICS | 1995年 / 90卷 / 1-3期
关键词：
D O I：
10.1007/BF02783207
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An infinite graph G is called strongly perfect ii each induced subgraph of G has a coloring (C-i: i is an element of I) and a clique meeting each color C-i. A conjecture of the first author and V. Korman is that a perfect graph with no infinite independent set is strongly perfect. We prove the conjecture for chordal graphs and for their complements.
引用
收藏
页码：81 / 91
页数：11
相关论文
共 50 条
12345