… determine [G] for a given graph G. In this paper, we shall study this problem for some dense
graphs G such that the … We shall use the adjoint polynomial of a graph as a tool for this study. …

… They found several families of such graphs. Since then many invariants under chromatic …
of the graph. We study several invariants of this polynomial and roots of some particular ones. It …

… This family of graphs is also 4-critical: If we remove any of the … k≤-chromaticity is strictly
stronger than strong k-chromaticity, … flexibility, but may lose in density, though not always strictly. …

… chromatic polynomials of graphs from some special families. A … An important result for the
study of chromaticity of K4-… real chromatic roots of planar graphs are dense in the interval (32/27…

… chromaticity of some classes of graphs, that is dense graphs, complete multipartite graphs
and general multipartite graphs. … They gave several families of chromatically unique graphs [9, …

… (1–3) 1– 11 Haynes, TW, MA Henning and LC van der Merwe, Total domination
supercritical graphs with respect to relative … Liu, Chromaticity of a family of K4-homeomorphs …

… Some researchers, such as Du [8] and Li and Whitehead [15], have used σ-polynomials to
study the chromaticity of some dense graphs, … properties of this family of graphs. The following …

… a graph over the family of connected k -chromatic graphs of … k -critical graphs (those minimal
with respect to k -chromaticity) … bound improves previously known bounds for dense graphs. …

… if G is a graph without isolated vertices, we show that a graph G is … of many families of dense
graphs is also determined. … It turns out that many new results on chromaticity of graphs could …

… zeros in (1, 32/27] but chromatic zeros are dense in [32/27, ∞). Let G be the family of
connected graphs of order at least 2. For any G ∈ G, we define the following graph-function …