Add to ORKGLet P (G; ¸) be a chromatic polynomial of a graphG: Two graphsG andH are said to be chromatically equivalent, denoted G » H; if P (G; ¸) = P (H;¸): We write [G] = fH jH » Gg: If [G] = fGg; then G is said to be chromatically unique. In this paper, we ¯rst characterize certain complete 4-partite graphs G accordingly to the number of 5-independent partitions of G: Using these results, we investigate the chromaticity of G with certain star or matching deleted. As a by-product, we obtain new families of chromatically unique complete 4-partite graphs with certain star or matching deleted. 1
AbstractIn this paper, the set of all graphs having the same chromatic polynomial as that of the gra...
Graphs are a set of vertices and edges. All vertices may or may not be joint. Vertex coloring is th...
Abstract. Let P (G;) be the chromatic polynomial of a graph G. A graph G is chromatically unique if ...
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromaticall...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chrom...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
Let P.G; / be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any gr...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...
Let \(P(G, x)\) be a chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are called ch...
Let P(G,x) be a chromatic polynomial of a graph G. Two graphs G and H are called chromatically equiv...
AbstractLet G be a simple graph and P(G,λ) denote the chromatic polynomial of G. Then G is said to b...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial and let [G] be the set of graphs havin...
AbstractWe prove that graphs obtained from complete equibipartite graphs by deleting some independen...
AbstractIn this paper, the set of all graphs having the same chromatic polynomial as that of the gra...
Graphs are a set of vertices and edges. All vertices may or may not be joint. Vertex coloring is th...
Abstract. Let P (G;) be the chromatic polynomial of a graph G. A graph G is chromatically unique if ...
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromaticall...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chrom...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
Let P.G; / be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any gr...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...
Let \(P(G, x)\) be a chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are called ch...
Let P(G,x) be a chromatic polynomial of a graph G. Two graphs G and H are called chromatically equiv...
AbstractLet G be a simple graph and P(G,λ) denote the chromatic polynomial of G. Then G is said to b...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial and let [G] be the set of graphs havin...
AbstractWe prove that graphs obtained from complete equibipartite graphs by deleting some independen...
AbstractIn this paper, the set of all graphs having the same chromatic polynomial as that of the gra...
Graphs are a set of vertices and edges. All vertices may or may not be joint. Vertex coloring is th...
Abstract. Let P (G;) be the chromatic polynomial of a graph G. A graph G is chromatically unique if ...