More connections between the matching polynomial and the chromatic polynomial
The connection between the matching polynomial and the chromatic polynomial for triangle-free graphs was revealed in the work of Farrell and Whitehead. We extend this result to all graph by mirroring the corresponding result of Godsil and Gutman for the acyclic polynomial and the characteristic poly...
Main Authors: | Beatriz Carely Luna-Olivera, Criel Merino, Marcelino Ramírez-Ibáñez |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2019-12-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860017301226 |
Similar Items
-
Connection between Graphs' Chromatic and Ehrhart Polynomials
by: Ola Neamah, et al.
Published: (2023-10-01) -
Chromatic Polynomials of Mixed Hypercycles
by: Allagan Julian A., et al.
Published: (2014-08-01) -
Chromatic polynomials of signed graphs
by: Utomo, Charissa Irene
Published: (2023) -
Problems on chromatic polynomials of hypergraphs
by: Ruixue Zhang, et al.
Published: (2020-10-01) -
Bivariate Chromatic Polynomials of Mixed Graphs
by: Matthias Beck, et al.
Published: (2023-11-01)