论文信息 - Connections between the matching and chromatic polynomials

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.

E. G. Whitehead | E. Farrell

[1] R. Read. An introduction to chromatic polynomials , 1968 .

[2] JAY R. GOLDMAN,et al. Rook theory III. Rook polynomials and the chromatic structure of graphs , 1978, J. Comb. Theory, Ser. B.

[3] E. J. Farrell. On a class of polynomials obtained from the circuits in a graph and its application to characteristics polynomials of graphs , 1979, Discret. Math..

[4] Thomas Zaslavsky. Complementary Matching Vectors and the Uniform Matching Extension Property , 1981, Eur. J. Comb..

[5] Roberto W. Frucht,et al. A note on the matching numbers of triangle-free graphs , 1985, J. Graph Theory.

[6] E. Farrell,et al. Some general classes of comatching graphs , 1987 .