scientific article; zbMATH DE number 4181365

zbMATH Open0717.05035MaRDI QIDQ3204485FDOQ3204485

Authors: Martin Anthony 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

spanning treeschromatic polynomialTutte polynomialtime-complexityWhitney expansion

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (16)

• Title not available (Why is that?)
• Polychromatic polynomials
• Title not available (Why is that?)
• A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
• Title not available (Why is that?)
• A matrix method for chromatic polynomials
• Foundations of the chromatic polynomial
• Title not available (Why is that?)
• Title not available (Why is that?)
• Using thresholds to compute chromatic polynomials.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph-Theoretic Concepts in Computer Science
• Umbral interpolation and the addition/contraction tree for graphs
• Finding the chromatic polynomial of Cayley graphs using the Tutte polynomial.
• Recursive formula for calculating the chromatic polynomial of a graph by vertex deletion

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)