A generalization of the dichromatic polynomial of a graph

E. J. Farrell

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

Abstract:

The Subgraph polynomial fo a graph pair ( G , H ) , where H ⫅ G , is defined. By assigning particular weights to the variables, it is shown that this polynomial reduces to the dichromatic polynomial of G . This idea of a graph pair leads to a dual generalization of the dichromatic polynomial.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/4/785710.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/4/785710.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:785710

DOI: 10.1155/S0161171281000550

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 ().