On Perfect Cayley Graphs
A graph is perfect if each of its induced subgraphs H has the property that its chromatic number χ(H) equals its clique number ω(H). The Strong Perfect Graph Conjecture (SPGC) states: An undirected graph is perfect if and only if neither G nor its complement G contains, as an induced subgraph, a cho...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | text |
| 出版: |
Archīum Ateneo
2002
|
| 主題: | |
| 在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/84 https://www.sciencedirect.com/science/article/abs/pii/S157106530400112X?via%3Dihub#! |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|