More connections between the matching polynomial and the chromatic polynomial
From MaRDI portal
Publication:2176164
Recommendations
Cites work
- A weighted graph polynomial from chromatic invariants of knots
- Algebraic Graph Theory
- Chip firing and the Tutte polynomial
- Connections between the matching and chromatic polynomials
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- Increasing trees and alternating permutations
- Intersection theory for graphs
- On a class of polynomials associated with the cliques in a graph and its applications
- On a general class of graph polynomials
- On the theory of the matching polynomial
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- The equivalence of two graph polynomials and a symmetric function
Cited in
(3)
This page was built for publication: More connections between the matching polynomial and the chromatic polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176164)