Add to ORKGLet P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs G with 6n + i vertices for i = 0, 1, 2 according to the number of 7-independent partitions of G. Using these results, we investigate the chromaticity of G with certain star or match-ing deleted. As a by-product, many new families of chromatically unique complete 6-partite graphs G with certain star or matching deleted are obtained
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial and let [G] be the set of graphs havin...
AbstractLet P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is i...
Let P (G; ¸) be a chromatic polynomial of a graphG: Two graphsG andH are said to be chromatically eq...
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...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
AbstractLet G be a simple graph and P(G,λ) denote the chromatic polynomial of G. Then G is said to b...
Let P.G; / be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any gr...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
Let P(G,x) be a chromatic polynomial of a graph G. Two graphs G and H are called chromatically equiv...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
Let \(P(G, x)\) be a chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are called ch...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chrom...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial and let [G] be the set of graphs havin...
AbstractLet P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is i...
Let P (G; ¸) be a chromatic polynomial of a graphG: Two graphsG andH are said to be chromatically eq...
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...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
AbstractLet G be a simple graph and P(G,λ) denote the chromatic polynomial of G. Then G is said to b...
Let P.G; / be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any gr...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
Let P(G,x) be a chromatic polynomial of a graph G. Two graphs G and H are called chromatically equiv...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
Let \(P(G, x)\) be a chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are called ch...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chrom...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial and let [G] be the set of graphs havin...
AbstractLet P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is i...