An algorithm which outputs a graph with a specified chromatic factor

DOI10.1016/j.dam.2018.10.033zbMath1406.05046OpenAlexW2901140853WikidataQ128944958 ScholiaQ128944958MaRDI QIDQ1730229

Kerri Morgan, Daniel Delbourgo

Publication date: 11 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.10.033

zbMATH Keywords

chromatic polynomialTutte polynomialchromatic roots\(\alpha + n\)-conjecture

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

\(p\)-adic roots of chromatic polynomials ⋮ Unnamed Item

Uses Software

• PARI/GP

Cites Work

• Unnamed Item
• Unnamed Item
• Chromatic polynomials of complements of bipartite graphs
• On chromatic coefficients
• On the Computation of Totally Real Quartic Fields of Small Discriminant
• Enumeration of Quartic Fields of Small Discriminant
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• A Table of Quintic Number Fields
• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• Chromatic Roots are Dense in the Whole Complex Plane
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial.

This page was built for publication: An algorithm which outputs a graph with a specified chromatic factor