关于K-完美超图的一些性子.pdfVIP

G G 1961  . H ℄ 2  1. 1.2.1 H  k- H k- H ℄ B ω (H − B) ω (H ). A k A k A 2. 1.3.1 H 2 [H]2 . H  k- , ωk (H ) = max ⌈ |A| ⌉, A = α(HA ) ∅, A ⊆ X (H ) 4. 1.4.2 H X = {x , x , , x }  k 1 2 n II Hp  k ,p ∈ Nn . 5. 2.1 H , L(H) 6. 3.1  k,2 ≤ k ≤ r (H ), H H  k- 7. 3.2  k,2 ≤ k ≤ r (H ), H k H∗  H C X(H) H C = C C ∪ {E |E ∈ H, |E | k}C H k- k k :  k ; k k- ; ; ; ; ; ; . III The motivations of this thesis are Lovasz’work and Berge’s work on perfect graphs,which show the properties and concerned theorems of per- fect graphs in detail.A graph G is perfect if G and each of its induced sub- graphs have the property that the chromatic number χ equals the size of a maximum clique ω . The i