Jason I. Brown

most citedExtremal Restraints for Graph Colourings

6 citations · 6 across the 5 of their papers we have counts for

collaborators

4 papers

math.CO2016

A note on the real part of complex chromatic roots

Jason Brown, Aysel Erey

A {\em chromatic root} is a root of the chromatic polynomial of a graph. While the real chromatic roots have been extensively studied and well understood, little is known about the…

math.CO2016

New Bounds for Chromatic Polynomials and Chromatic Roots

Jason Brown, Aysel Erey

If $G$ is a $k$ -chromatic graph of order $n$ then it is known that the chromatic polynomial of $G$ , $π (G, x)$ , is at most $x (x - 1) \dots (x - (k - 1)) x^{n - k} = (x)_{↓ k} x^{n - k}$ …

math.CO2016

On the real roots of $σ$ -Polynomials

Jason Brown, Aysel Erey

The $σ$ -polynomial is given by $σ (G, x) = \sum_{i = χ (G)}^{n} a_{i} (G) x^{i}$ , where $a_{i} (G)$ is the number of partitions of the vertices of $G$ into $i$ nonempty independent sets…

math.CO2016★ 6 cited

Extremal Restraints for Graph Colourings

Jason I. Brown, Aysel Erey, Jian Li

A {\em restraint} on a (finite undirected) graph $G = (V, E)$ is a function $r$ on $V$ such that $r (v)$ is a finite subset of $N$ ; a proper vertex colouring $c$ of $G$ is…

A note on the real part of complex chromatic roots

New Bounds for Chromatic Polynomials and Chromatic Roots

On the real roots of σ-Polynomials

Extremal Restraints for Graph Colourings

On the real roots of $σ$ -Polynomials