AbstractIn this paper, using the properties of chromatic polynomial and adjoint polynomial, we characterize all graphs having chromatic polynomial ∑l⩽m0lm0−l(λ)l
AbstractLet G be a spanning subgraph of the complete bipartite graph Kn,n. In this paper, we obtain ...
AbstractFor a given graph G, denote by GΔ the subgraph of G induced by the vertices of maximum degre...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
AbstractLet β(G) denote the minimum real root of the σ-polynomial of the complement of a graph G and...
AbstractFor a graph G, we denote by h(G,x) the adjoint polynomial of G. Let β(G) denote the minimum ...
AbstractBy h(G,x) and P(G,λ) we denote the adjoint polynomial and the chromatic polynomial of a grap...
AbstractLet P(G,λ) denote the chromatic polynomial of a graph G. A graph G is chromatically unique i...
AbstractFor integers p,q,s with p⩾q⩾2 and s⩾0, let K2−s(p,q) denote the set of 2-connected bipartite...
AbstractLet G be a simple graph and P(G,λ) denote the chromatic polynomial of G. Then G is said to b...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
AbstractThe chromatic polynomial of a simple graph G with n>0 vertices is a polynomial ∑k=1nαk(G)x(x...
AbstractLet P(G, λ) denote the chromatic polynomial of a graph G. It is proved in this paper that fo...
AbstractWe investigate the chromatic polynomial χ(G, λ) of an unlabeled graph G. It is shown that χ(...
AbstractFor any positive integer n, let Gn denote the set of simple graphs of order n. For any graph...
AbstractLet G be a spanning subgraph of the complete bipartite graph Kn,n. In this paper, we obtain ...
AbstractFor a given graph G, denote by GΔ the subgraph of G induced by the vertices of maximum degre...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
AbstractLet β(G) denote the minimum real root of the σ-polynomial of the complement of a graph G and...
AbstractFor a graph G, we denote by h(G,x) the adjoint polynomial of G. Let β(G) denote the minimum ...
AbstractBy h(G,x) and P(G,λ) we denote the adjoint polynomial and the chromatic polynomial of a grap...
AbstractLet P(G,λ) denote the chromatic polynomial of a graph G. A graph G is chromatically unique i...
AbstractFor integers p,q,s with p⩾q⩾2 and s⩾0, let K2−s(p,q) denote the set of 2-connected bipartite...
AbstractLet G be a simple graph and P(G,λ) denote the chromatic polynomial of G. Then G is said to b...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
AbstractThe chromatic polynomial of a simple graph G with n>0 vertices is a polynomial ∑k=1nαk(G)x(x...
AbstractLet P(G, λ) denote the chromatic polynomial of a graph G. It is proved in this paper that fo...
AbstractWe investigate the chromatic polynomial χ(G, λ) of an unlabeled graph G. It is shown that χ(...
AbstractFor any positive integer n, let Gn denote the set of simple graphs of order n. For any graph...
AbstractLet G be a spanning subgraph of the complete bipartite graph Kn,n. In this paper, we obtain ...
AbstractFor a given graph G, denote by GΔ the subgraph of G induced by the vertices of maximum degre...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
DOI
Add to ORKG