More connections between the matching polynomial and the chromatic polynomial
From MaRDI portal
Publication:2176164
DOI10.1016/J.AKCEJ.2018.08.008zbMATH Open1439.05113OpenAlexW2889570586MaRDI QIDQ2176164FDOQ2176164
Authors: Marcelino Ramírez-Ibáñez, Beatriz Carely Luna Olivera, Criel Merino
Publication date: 4 May 2020
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2018.08.008
Recommendations
Cites Work
- Intersection theory for graphs
- A weighted graph polynomial from chromatic invariants of knots
- The equivalence of two graph polynomials and a symmetric function
- Chip firing and the Tutte polynomial
- Algebraic Graph Theory
- On the theory of the matching polynomial
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- Increasing trees and alternating permutations
- On a general class of graph polynomials
- On a class of polynomials associated with the cliques in a graph and its applications
- Connections between the matching and chromatic polynomials
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
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)