AbstractThis paper establishes a relation between the Clar covering polynomial of hexagonal systems and chromatic polynomials. As applications, the explicit expressions of chromatic polynomials of some types of graphs are derived. This paper also presents various results on Clar cover equivalence and uniqueness of hexagonal systems
Let P(G,y) denote the chromatic polynomial of a graph G expressed in the variable y. A graph G is ch...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractA new concept of circulant chromatic function of a graph is introduced to generalize the con...
AbstractThis paper establishes a relation between the Clar covering polynomial of hexagonal systems ...
AbstractIn this paper the Clar covering polynomial of a hexagonal system is introduced. In fact it i...
AbstractThe Clar covering polynomial is a recently proposed concept of hexagonal systems by which so...
AbstractSextet rotations of the perfect matchings of a hexagonal system H are represented by the sex...
Chromatic polynomials of graphs have been studied extensively for around one century. The concept of...
AbstractIn this paper, we describe some unsolved problems on chromatic polynomials along with a brie...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractThis expository paper is a general introduction to the theory of chromatic polynomials. Chro...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
In this paper we give first a new combinatorial interpretation of the coefficients of chromatic poly...
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of t...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
Let P(G,y) denote the chromatic polynomial of a graph G expressed in the variable y. A graph G is ch...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractA new concept of circulant chromatic function of a graph is introduced to generalize the con...
AbstractThis paper establishes a relation between the Clar covering polynomial of hexagonal systems ...
AbstractIn this paper the Clar covering polynomial of a hexagonal system is introduced. In fact it i...
AbstractThe Clar covering polynomial is a recently proposed concept of hexagonal systems by which so...
AbstractSextet rotations of the perfect matchings of a hexagonal system H are represented by the sex...
Chromatic polynomials of graphs have been studied extensively for around one century. The concept of...
AbstractIn this paper, we describe some unsolved problems on chromatic polynomials along with a brie...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractThis expository paper is a general introduction to the theory of chromatic polynomials. Chro...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
In this paper we give first a new combinatorial interpretation of the coefficients of chromatic poly...
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of t...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
Let P(G,y) denote the chromatic polynomial of a graph G expressed in the variable y. A graph G is ch...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractA new concept of circulant chromatic function of a graph is introduced to generalize the con...
DOI
Add to ORKG