AbstractIt is proved that the chromatic polynomial of a connected graph with n vertices and m edges has a root with modulus at least (m−1)/(n−2); this bound is best possible for trees and 2-trees (only). It is also proved that the chromatic polynomial of a graph with few triangles that is not a forest has a nonreal root and that there is a graph with n vertices whose chromatic polynomial has a root with imaginary part greater thann/4
AbstractIn this paper, using the properties of chromatic polynomial and adjoint polynomial, we chara...
AbstractLet β(G) denote the minimum real root of the σ-polynomial of the complement of a graph G and...
AbstractLet P(G, λ) denote the chromatic polynomial of a graph G. It is proved in this paper that fo...
AbstractIt is proved that the chromatic polynomial of a connected graph with n vertices and m edges ...
A chromatic root is a root of the chromatic polynomial of a graph.Any chromatic root is an algebraic...
A chromatic root is a root of the chromatic polynomial of a graph.Any chromatic root is an algebraic...
AbstractIt is well known that chromatic polynomials can have roots (chromatic roots) of arbitrarily ...
AbstractGiven a graph G, we derive an expression for the chromatic polynomials of the graphs resulti...
In this thesis we examine chromatic polynomials from the viewpoint of algebraic number theory. We re...
A chromatic root is a zero of the chromatic polynomial of a graph. At a Newton Institute workshop on...
AbstractIt is proved that if every subcontraction of a graph G contains a vertex with degree at most...
AbstractIt is known that the chromatic polynomial of any chordal graph has only integer roots. Howev...
AbstractIt is easy to verify that the chromatic polynomial of a graph with order at most 4 has no no...
The degree chromatic polynomial $P_m(G,k)$ of a graph $G$ counts the number of $k$ -colorings in whi...
Abstract. Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial...
AbstractIn this paper, using the properties of chromatic polynomial and adjoint polynomial, we chara...
AbstractLet β(G) denote the minimum real root of the σ-polynomial of the complement of a graph G and...
AbstractLet P(G, λ) denote the chromatic polynomial of a graph G. It is proved in this paper that fo...
AbstractIt is proved that the chromatic polynomial of a connected graph with n vertices and m edges ...
A chromatic root is a root of the chromatic polynomial of a graph.Any chromatic root is an algebraic...
A chromatic root is a root of the chromatic polynomial of a graph.Any chromatic root is an algebraic...
AbstractIt is well known that chromatic polynomials can have roots (chromatic roots) of arbitrarily ...
AbstractGiven a graph G, we derive an expression for the chromatic polynomials of the graphs resulti...
In this thesis we examine chromatic polynomials from the viewpoint of algebraic number theory. We re...
A chromatic root is a zero of the chromatic polynomial of a graph. At a Newton Institute workshop on...
AbstractIt is proved that if every subcontraction of a graph G contains a vertex with degree at most...
AbstractIt is known that the chromatic polynomial of any chordal graph has only integer roots. Howev...
AbstractIt is easy to verify that the chromatic polynomial of a graph with order at most 4 has no no...
The degree chromatic polynomial $P_m(G,k)$ of a graph $G$ counts the number of $k$ -colorings in whi...
Abstract. Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial...
AbstractIn this paper, using the properties of chromatic polynomial and adjoint polynomial, we chara...
AbstractLet β(G) denote the minimum real root of the σ-polynomial of the complement of a graph G and...
AbstractLet P(G, λ) denote the chromatic polynomial of a graph G. It is proved in this paper that fo...
DOI
Add to ORKG