AbstractLetP(λ) be the chromatic polynomial of a graph. We show thatP(5)−1P(6)2P(7)−1can be arbitrarily small, disproving a conjecture of Welsh (and of Brenti, independently) thatP(λ)2⩾P(λ−1)P(λ+1)and also disproving several other conjectures of Brenti. Secondly, we prove that if the graph has n vertices, thenP(n)P(n−1)−1⩾2.718253,approaching a conjecture of Bartels and Welsh thatP(n)P(n−1)−1⩾e(eis 2.718281 …)
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
This is the peer reviewed version of the following article: Scott, A., Seymour, P., & Spirkl, S. (20...
A chromatic root is a zero of the chromatic polynomial of a graph. At a Newton Institute workshop on...
AbstractLet P(G, λ) denote the chromatic polynomial of a graph G. It is proved in this paper that fo...
We propose two conjectures on the chromatic polynomial of a graph and show their validity for severa...
AbstractLetP(λ) be the chromatic polynomial of a graph. We show thatP(5)−1P(6)2P(7)−1can be arbitrar...
Let G be a graph with n vertices and let P (G;) be its chromatic polynomial. It was conjectured by B...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractLet P(G,λ) denote the chromatic polynomial of a graph G. A graph G is chromatically unique i...
Let P(G, lambda) be the chromatic polynomial of a graph G with n vertices, independence number alpha...
The degree chromatic polynomial $P_m(G,k)$ of a graph $G$ counts the number of $k$ -colorings in whi...
AbstractIn this paper, using the properties of chromatic polynomial and adjoint polynomial, we chara...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
AbstractHere quadratic and cubic σ-polynomials are characterized, or, equivalently, chromatic polyno...
AbstractThe chromatic polynomial is a well studied object in graph theory. There are many results an...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
This is the peer reviewed version of the following article: Scott, A., Seymour, P., & Spirkl, S. (20...
A chromatic root is a zero of the chromatic polynomial of a graph. At a Newton Institute workshop on...
AbstractLet P(G, λ) denote the chromatic polynomial of a graph G. It is proved in this paper that fo...
We propose two conjectures on the chromatic polynomial of a graph and show their validity for severa...
AbstractLetP(λ) be the chromatic polynomial of a graph. We show thatP(5)−1P(6)2P(7)−1can be arbitrar...
Let G be a graph with n vertices and let P (G;) be its chromatic polynomial. It was conjectured by B...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractLet P(G,λ) denote the chromatic polynomial of a graph G. A graph G is chromatically unique i...
Let P(G, lambda) be the chromatic polynomial of a graph G with n vertices, independence number alpha...
The degree chromatic polynomial $P_m(G,k)$ of a graph $G$ counts the number of $k$ -colorings in whi...
AbstractIn this paper, using the properties of chromatic polynomial and adjoint polynomial, we chara...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
AbstractHere quadratic and cubic σ-polynomials are characterized, or, equivalently, chromatic polyno...
AbstractThe chromatic polynomial is a well studied object in graph theory. There are many results an...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
This is the peer reviewed version of the following article: Scott, A., Seymour, P., & Spirkl, S. (20...
A chromatic root is a zero of the chromatic polynomial of a graph. At a Newton Institute workshop on...
DOI
Add to ORKG