Bivariate chromatic polynomials in computer algebra
From MaRDI portal
Recommendations
Cites work
- A graph theory package for Maple
- A Most General Edge Elimination Polynomial
- An introduction to chromatic polynomials
- Chromatic polynomials of complements of bipartite graphs
- Einführung in die Kombinatorik
- scientific article; zbMATH DE number 50596 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 2038883 (Why is no real title available?)
- scientific article; zbMATH DE number 953808 (Why is no real title available?)
- Matching theory
- On colorings of split graphs
- On multivariate chromatic polynomials of hypergraphs and hyperedge elimination
- Proving properties of the edge elimination polynomial using equivalent graph polynomials
Cited in
(7)- An extension of the bivariate chromatic polynomial
- An algorithm which outputs a graph with a specified chromatic factor
- Bivariate order polynomials
- scientific article; zbMATH DE number 4181365 (Why is no real title available?)
- A bivariate chromatic polynomial for signed graphs
- Bivariate chromatic polynomials of mixed graphs
- Chromatic polynomials of complements of bipartite graphs
This page was built for publication: Bivariate chromatic polynomials in computer algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733312)