Publication date
August 1997
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractThe aim of this expository paper is to give a survey of the results on chromatically unique graphs obtained by studying their adjoint polynomials
AbstractThe aim of this expository paper is to give a survey of the results on chromatically unique graphs obtained by studying their adjoint polynomials
AbstractThis expository paper gives a survey on most of the works done on chromatically unique graph...
AbstractLet β(G) denote the minimum real root of the σ-polynomial of the complement of a graph G and...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractWe give a brief survey on a new method for proving the chromatic uniqueness of graphs by the...
AbstractA tree is called a tree of T-shape if its degree sequence is (1,1,1,2,2, …, 2,3). In this pa...
AbstractThe aim of this expository paper is to give a survey of the results on chromatically unique ...
AbstractLet P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is i...
The study of chromatically unique graphs has been drawing much attention and many results are survey...
The study of chromatically unique graphs has been drawing much attention and many results are survey...
The study of chromatically unique graphs has been drawing much attention and many results are survey...
AbstractWe give a brief survey on a new method for proving the chromatic uniqueness of graphs by the...
The study of chromatically unique graphs has been drawing much attention and many results are survey...
AbstractLet Pn and Cn denote the path and cycle of order n. In [6], Guo and Li conjectured that if G...
AbstractIn this paper, we describe some unsolved problems on chromatic polynomials along with a brie...
AbstractIn this paper, the set of all graphs having the same chromatic polynomial as that of the gra...
AbstractThis expository paper gives a survey on most of the works done on chromatically unique graph...
AbstractLet β(G) denote the minimum real root of the σ-polynomial of the complement of a graph G and...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractWe give a brief survey on a new method for proving the chromatic uniqueness of graphs by the...
AbstractA tree is called a tree of T-shape if its degree sequence is (1,1,1,2,2, …, 2,3). In this pa...
AbstractThe aim of this expository paper is to give a survey of the results on chromatically unique ...
AbstractLet P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is i...
The study of chromatically unique graphs has been drawing much attention and many results are survey...
The study of chromatically unique graphs has been drawing much attention and many results are survey...
The study of chromatically unique graphs has been drawing much attention and many results are survey...
AbstractWe give a brief survey on a new method for proving the chromatic uniqueness of graphs by the...
The study of chromatically unique graphs has been drawing much attention and many results are survey...
AbstractLet Pn and Cn denote the path and cycle of order n. In [6], Guo and Li conjectured that if G...
AbstractIn this paper, we describe some unsolved problems on chromatic polynomials along with a brie...
AbstractIn this paper, the set of all graphs having the same chromatic polynomial as that of the gra...
AbstractThis expository paper gives a survey on most of the works done on chromatically unique graph...
AbstractLet β(G) denote the minimum real root of the σ-polynomial of the complement of a graph G and...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
Add to ORKG