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:
Main Authors: | , |
---|---|
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!
|
_version_ | 1832566177841283072 |
---|---|
author | E. J. Farrell Earl Glen Whitehead |
author_facet | E. J. Farrell Earl Glen Whitehead |
author_sort | E. J. Farrell |
collection | DOAJ |
description | 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. |
format | Article |
id | doaj-art-03f42a28f504443987e4524cc70eccbd |
institution | Kabale University |
issn | 0161-1712 1687-0425 |
language | English |
publishDate | 1992-01-01 |
publisher | Wiley |
record_format | Article |
series | International Journal of Mathematics and Mathematical Sciences |
spelling | doaj-art-03f42a28f504443987e4524cc70eccbd2025-02-03T01:04:49ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251992-01-0115475776610.1155/S016117129200098XConnections between the matching and chromatic polynomialsE. J. Farrell0Earl Glen Whitehead1Department of Mathematics, The University of the West Indies, St. Augustine, Trinidad and TobagoDepartment of Mathematics & Statistics, University of Pittsburgh, Pittsburgh 15260, PA, USAThe 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.http://dx.doi.org/10.1155/S016117129200098Xmatching polynomialchromatic polynomialmatching equivalencechromatic equivalencetriangle-free graphs. |
spellingShingle | E. J. Farrell Earl Glen Whitehead Connections between the matching and chromatic polynomials International Journal of Mathematics and Mathematical Sciences matching polynomial chromatic polynomial matching equivalence chromatic equivalence triangle-free graphs. |
title | Connections between the matching and chromatic polynomials |
title_full | Connections between the matching and chromatic polynomials |
title_fullStr | Connections between the matching and chromatic polynomials |
title_full_unstemmed | Connections between the matching and chromatic polynomials |
title_short | Connections between the matching and chromatic polynomials |
title_sort | connections between the matching and chromatic polynomials |
topic | matching polynomial chromatic polynomial matching equivalence chromatic equivalence triangle-free graphs. |
url | http://dx.doi.org/10.1155/S016117129200098X |
work_keys_str_mv | AT ejfarrell connectionsbetweenthematchingandchromaticpolynomials AT earlglenwhitehead connectionsbetweenthematchingandchromaticpolynomials |