scientific article; zbMATH DE number 4181365
From MaRDI portal
Publication:3204485
Recommendations
- The computation of chromatic polynomials
- scientific article; zbMATH DE number 4087683
- scientific article; zbMATH DE number 4091530
- Chromatic polynomials
- scientific article; zbMATH DE number 4128831
- scientific article; zbMATH DE number 1161304
- scientific article; zbMATH DE number 5626056
- Approximating the chromatic polynomial
- Bivariate chromatic polynomials in computer algebra
- A new method for calculating the chromatic polynomial
Cited in
(18)- scientific article; zbMATH DE number 140132 (Why is no real title available?)
- scientific article; zbMATH DE number 1409207 (Why is no real title available?)
- scientific article; zbMATH DE number 3904612 (Why is no real title available?)
- scientific article; zbMATH DE number 4087683 (Why is no real title available?)
- scientific article; zbMATH DE number 6724468 (Why is no real title available?)
- Using thresholds to compute chromatic polynomials.
- Polychromatic polynomials
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
- Computing the Tutte polynomial of Archimedean tilings
- scientific article; zbMATH DE number 5626056 (Why is no real title available?)
- Umbral interpolation and the addition/contraction tree for graphs
- scientific article; zbMATH DE number 4051660 (Why is no real title available?)
- Recursive formula for calculating the chromatic polynomial of a graph by vertex deletion
- Foundations of the chromatic polynomial
- Finding the chromatic polynomial of Cayley graphs using the Tutte polynomial.
- Graph-Theoretic Concepts in Computer Science
- A matrix method for chromatic polynomials
- A new edge selection heuristic for computing the Tutte polynomial of an undirected graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204485)
