Connections between the Matching and Chromatic Polynomials

13Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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. © 1992, Hindawi Publishing Corporation. All rights reserved.

Cite

CITATION STYLE

APA

Farrell, E. J., & Whitehead, E. G. (1992). Connections between the Matching and Chromatic Polynomials. International Journal of Mathematics and Mathematical Sciences, 15(4), 757–766. https://doi.org/10.1155/S016117129200098X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free