An algorithm which outputs a graph with a specified chromatic factor
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4204469 (Why is no real title available?)
- scientific article; zbMATH DE number 3264165 (Why is no real title available?)
- A Table of Quintic Number Fields
- A Zero-Free Interval for Chromatic Polynomials of Graphs
- Chromatic Roots are Dense in the Whole Complex Plane
- Chromatic polynomials of complements of bipartite graphs
- Enumeration of Quartic Fields of Small Discriminant
- On chromatic coefficients
- On the Computation of Totally Real Quartic Fields of Small Discriminant
- The Zero-Free Intervals for Chromatic Polynomials of Graphs
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial.
Cited in
(3)
This page was built for publication: An algorithm which outputs a graph with a specified chromatic factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1730229)