Connections between the matching and chromatic polynomials

The main results established are (i) a connection between the matching and chromatic polynomials and (ii) a formula for the matching polynomial of a general complement of a subgraph of a graph. Some deductions on matching and chromatic equivalence and uniqueness are made.

Saved in:
Bibliographic Details
Main Authors: E. J. Farrell, Earl Glen Whitehead
Format: Article
Language:English
Published: Wiley 1992-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Subjects:
Online Access:http://dx.doi.org/10.1155/S016117129200098X
Tags: Add Tag
No Tags, Be the first to tag this record!