An algorithm which outputs a graph with a specified chromatic factor
type: Item
instance of: scholarly article
title: An algorithm which outputs a graph with a specified chromatic factor
zbMATH Open document ID: 1406.05046
author: Daniel Delbourgo
author: Kerri Morgan
published in: Discrete Applied Mathematics
publication date: 2019-03-11T00:00:00Z
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7034215
zbMATH Keywords: chromatic polynomial
zbMATH Keywords: chromatic roots
zbMATH Keywords: \(\alpha + n\)-conjecture
zbMATH Keywords: Tutte polynomial
describes a project that uses: PARI/GP
MaRDI profile type: Publication
full work available at URL: j.dam.2018.10.033
OpenAlex ID: W2901140853
cites work: Chromatic polynomials of complements of bipartite graphs
cites work: On the Computation of Totally Real Quartic Fields of Small Discriminant
cites work: Enumeration of Quartic Fields of Small Discriminant
cites work: On chromatic coefficients
cites work: Q3353118
cites work: Q5549878
cites work: A Zero-Free Interval for Chromatic Polynomials of Graphs
cites work: Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial.
cites work: A Table of Quintic Number Fields
cites work: Chromatic Roots are Dense in the Whole Complex Plane
cites work: The Zero-Free Intervals for Chromatic Polynomials of Graphs
Wikidata QID: Q128944958
DOI: 10.1016/J.DAM.2018.10.033
description: scientific article; zbMATH DE number 7034215