Perfect graphs
The main objective of the study is to consolidate the works of Berge, Lovasz and Golumbic on finite perfect graphs. A graph G is perfect if G and each of its induced subgraphs have the property that the chromatic number is equal to the clique number. Specifically, it aimed to define a perfect graph,...
Saved in:
主要作者: | |
---|---|
格式: | text |
語言: | English |
出版: |
Animo Repository
1995
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/etd_masteral/1780 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|