DOIAbstract
AbstractLet P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is isomorphic to H for any graph H with P(H;λ) = P(G;λ). In this pasper, we provide two new classes of chromatically unique graphs
AbstractLet P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is isomorphic to H for any graph H with P(H;λ) = P(G;λ). In this pasper, we provide two new classes of chromatically unique graphs
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
Abstract. Let P (G;) be the chromatic polynomial of a graph G. A graph G is chromatically unique if ...
AbstractLet P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is i...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractLet G be a simple graph and P(G,λ) denote the chromatic polynomial of G. Then G is said to b...
AbstractLet P(G,λ) denote the chromatic polynomial of a graph G. A graph G is chromatically unique i...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial and let [G] be the set of graphs havin...
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; / 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...
AbstractA generalized θ-graph in a connected graph with 3 paths between a pair of vertices of degree...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
AbstractWe give a brief survey on a new method for proving the chromatic uniqueness of graphs by the...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
Abstract. Let P (G;) be the chromatic polynomial of a graph G. A graph G is chromatically unique if ...
AbstractLet P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is i...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractLet G be a simple graph and P(G,λ) denote the chromatic polynomial of G. Then G is said to b...
AbstractLet P(G,λ) denote the chromatic polynomial of a graph G. A graph G is chromatically unique i...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial and let [G] be the set of graphs havin...
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; / 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...
AbstractA generalized θ-graph in a connected graph with 3 paths between a pair of vertices of degree...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
AbstractWe give a brief survey on a new method for proving the chromatic uniqueness of graphs by the...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
Abstract. Let P (G;) be the chromatic polynomial of a graph G. A graph G is chromatically unique if ...
Add to ORKG