Connections between the matching and chromatic polynomials

Authors:
  • EWEarl Glen Whitehead
    Earl Glen Whitehead
Open Access
Publisher website
Google Scholar
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.