An infinite graph G is called strongly perfect ii each induced subgrap
h 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 tha
t a perfect graph with no infinite independent set is strongly perfect
. We prove the conjecture for chordal graphs and for their complements
.