A result on co-chromatic graphs

E. J. Farrell

International Journal of Mathematics and Mathematical Sciences, 1981, vol. 4, 1-5

Abstract:

A sufficient condition for two graphs with the same number of nodes to have the same chromatic polynomial is given.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/4/892925.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/4/892925.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:892925

DOI: 10.1155/S0161171281000227

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().