AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number of induced complete bipartite subgraphs in graphs with some given conditions. Using a theorem given in the first part, we prove the conjecture raised in (1982) that K(m, n) is chromatically unique when m ⩾ n ⩾ 2
Let \(P(G, x)\) be a chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are called ch...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
AbstractWe prove that graphs obtained from complete equibipartite graphs by deleting some independen...
AbstractWe prove the chromatic uniqueness of the following infinite families of bipartite graphs: Km...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
AbstractWe prove the chromatic uniqueness of the following infinite families of bipartite graphs: Km...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
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. Two graphs G and H are said to be chromaticall...
Let P.G; / be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any gr...
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...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
Let \(P(G, x)\) be a chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are called ch...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
AbstractWe prove that graphs obtained from complete equibipartite graphs by deleting some independen...
AbstractWe prove the chromatic uniqueness of the following infinite families of bipartite graphs: Km...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
AbstractWe prove the chromatic uniqueness of the following infinite families of bipartite graphs: Km...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
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. Two graphs G and H are said to be chromaticall...
Let P.G; / be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any gr...
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...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
Let \(P(G, x)\) be a chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are called ch...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
AbstractWe prove that graphs obtained from complete equibipartite graphs by deleting some independen...
DOI
Add to ORKG