A result on co-chromatic graphs
A sufficient condition for two graphs with the same number of nodes to have the same chromatic polynomial is given.
Na minha lista:
| 主要作者: | |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Wiley
1981-01-01
|
| 叢編: | International Journal of Mathematics and Mathematical Sciences |
| 主題: | |
| 在線閱讀: | http://dx.doi.org/10.1155/S0161171281000227 |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|