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.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
1981-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171281000227 |