Chromatic roots and minor-closed families of graphs

preprint2016arXivOpen access

Abstract

Given a minor-closed class of graphs G\mathcal{G}, what is the infimum of the non-trivial roots of the chromatic polynomial of G∈GG \in \mathcal{G}? When G\mathcal{G} is the class of all graphs, the answer is known to be 32/2732/27. We answer this question exactly for three minor-closed classes of graphs. Furthermore, we conjecture precisely when the value is larger than 32/2732/27.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.