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 条

[31] THE FRACTIONAL CHROMATIC NUMBER OF INFINITE-GRAPHS
LEADER, I
[J]. JOURNAL OF GRAPH THEORY, 1995, 20 (04) : 411 - 417
[32] ON SYSTEMS OF EQUATIONS DEFINING INFINITE-GRAPHS
BAUDERON, M
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 344 : 54 - 73
[33] SPANNING-TREES OF INFINITE-GRAPHS
POLAT, N
[J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 1991, 41 (01) : 52 - 60
[34] TOPOLOGICAL-GROUPS AND INFINITE-GRAPHS
WOESS, W
[J]. DISCRETE MATHEMATICS, 1991, 95 (1-3) : 373 - 384
[35] NORMAL TREE ORDERS FOR INFINITE-GRAPHS
BROCHET, JM
DIESTEL, R
[J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1994, 345 (02) : 871 - 895
[36] TREE-PARTITIONS OF INFINITE-GRAPHS
HALIN, R
[J]. DISCRETE MATHEMATICS, 1991, 97 (1-3) : 203 - 217
[37] THE ACTION OF NILPOTENT GROUPS ON INFINITE-GRAPHS
SEIFTER, N
[J]. MONATSHEFTE FUR MATHEMATIK, 1985, 99 (04): : 323 - 332
[38] THE DEGREE SETS OF CONNECTED INFINITE-GRAPHS
HARARY, F
HARZHEIM, E
[J]. FUNDAMENTA MATHEMATICAE, 1983, 118 (03) : 233 - 236
[39] CONNECTIVITY AND CHROMATIC NUMBER OF INFINITE-GRAPHS
KOMJATH, P
[J]. ISRAEL JOURNAL OF MATHEMATICS, 1986, 56 (03) : 257 - 266
[40] INFINITE-GRAPHS WITH A PRIMITIVE GROUP OF AUTOMORPHISMS
WATKINS, ME
[J]. DISCRETE MATHEMATICS, 1994, 130 (1-3) : 177 - 182

← 1 2 3 4 5 →