On the location of chromatic zeros of series-parallel graphs

04/21/2022
by   Ferenc Bencs, et al.
0

In this paper we consider the zeros of the chromatic polynomial of series-parallel graphs. Complementing a result of Sokal, showing density outside the disk {z∈ℂ| |z-1| ≤ 1}, we show density of these zeros in the half plane (q)>3/2 and we show there exists an open region U containing the interval (0,32/27) such that U∖{1} does not contain zeros of the chromatic polynomial of series-parallel graphs. We also disprove a conjecture of Sokal by showing that for each large enough integer Δ there exists a series-parallel graph for which all vertices but one have degree at most Δ and whose chromatic polynomial has a zero with real part exceeding Δ.

READ FULL TEXT
research
08/09/2020

Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time

A plane graph is rectilinear planar if it admits an embedding-preserving...
research
02/21/2022

Efficient computation of oriented vertex and arc colorings of special digraphs

In this paper we study the oriented vertex and arc coloring problem on e...
research
10/01/2021

Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs

We study the long-standing open problem of efficiently testing rectiline...
research
05/02/2022

Taming graphs with no large creatures and skinny ladders

We confirm a conjecture of Gartland and Lokshtanov [arXiv:2007.08761]: i...
research
08/17/2015

Knuthian Drawings of Series-Parallel Flowcharts

Inspired by a classic paper by Knuth, we revisit the problem of drawing ...
research
04/11/2022

On complex roots of the independence polynomial

It is known from the work of Shearer (1985) (and also Scott and Sokal (2...
research
04/01/2021

O(1) Steiner Point Removal in Series-Parallel Graphs

We study how to vertex-sparsify a graph while preserving both the graph'...

Please sign up or login with your details

Forgot password? Click here to reset