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
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...
The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix metho...
AbstractThis paper establishes a relation between the Clar covering polynomial of hexagonal systems ...
AbstractThe Clar covering polynomial is a recently proposed concept of hexagonal systems by which so...
AbstractIn this paper the Clar covering polynomial of a hexagonal system is introduced. In fact it i...
AbstractSextet rotations of the perfect matchings of a hexagonal system H are represented by the sex...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
AbstractIn this paper we establish a simple criterion which enables us to determine whether or not a...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined...
AbstractIn this paper, the set of all graphs having the same chromatic polynomial as that of the gra...
AbstractIn this paper, we describe some unsolved problems on chromatic polynomials along with a brie...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractIn this paper, we introduce and study an extension of the chromatic polynomial of a graph. T...
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...
The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix metho...
AbstractThis paper establishes a relation between the Clar covering polynomial of hexagonal systems ...
AbstractThe Clar covering polynomial is a recently proposed concept of hexagonal systems by which so...
AbstractIn this paper the Clar covering polynomial of a hexagonal system is introduced. In fact it i...
AbstractSextet rotations of the perfect matchings of a hexagonal system H are represented by the sex...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
AbstractIn this paper we establish a simple criterion which enables us to determine whether or not a...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined...
AbstractIn this paper, the set of all graphs having the same chromatic polynomial as that of the gra...
AbstractIn this paper, we describe some unsolved problems on chromatic polynomials along with a brie...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractIn this paper, we introduce and study an extension of the chromatic polynomial of a graph. T...
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...
The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix metho...