Connections between the matching and chromatic polynomials
E. J. Farrell1and Earl Glen Whitehead2
Received08 Jun 1990
Revised06 Jun 1991
Abstract
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.