AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal systems in a hexagonal system. By this algorithm we can decompose a hexagonal system into a number of regions consisting of fixed bonds and a number of normal subhexagonal systems. This decomposition can be used to simplify the procedure of finding Clar's formula, counting the number of Kekulé structures and constructing the Z-transformation graph of a hexagonal system with fixed bonds, especially for large hexagonal systems. We also give characterizations of hexagonal systems with fixed single and double bonds, respectively
AbstractAn edge of a generalized hexagonal system H is said to be not fixed if it belongs to some bu...
AbstractStarting with the major graph theoretical in variants of n = No. of vertices (points), q = N...
This paper presents some results of the first investigations on the application of the recently disc...
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
Abstract. Hexagonal systems are geometric objects obtained by arranging mu-tually congruent regular ...
AbstractIn this paper the Clar covering polynomial of a hexagonal system is introduced. In fact it i...
AbstractThis paper provides a combinatorial characterization for the class of graphs that model mole...
. A simple way to calculate the number of k-matchings, k 5, in hexagonal systems is presented. Some...
AbstractSextet rotations of the perfect matchings of a hexagonal system H are represented by the sex...
Benzene is an important structure in chemistry due to its stability and the stability it can provide...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
Abstract. The vertex set of the resonance graph of a hexagonal graph G consists of 1-factors of G, t...
Di-4-catafusenes are defined as catacondensed polygonal systems consisting of two tetragons each and...
A polyene graph is a tree that can be embedded in a hexagonal lattice. Systems of polyene graphs att...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
AbstractAn edge of a generalized hexagonal system H is said to be not fixed if it belongs to some bu...
AbstractStarting with the major graph theoretical in variants of n = No. of vertices (points), q = N...
This paper presents some results of the first investigations on the application of the recently disc...
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
Abstract. Hexagonal systems are geometric objects obtained by arranging mu-tually congruent regular ...
AbstractIn this paper the Clar covering polynomial of a hexagonal system is introduced. In fact it i...
AbstractThis paper provides a combinatorial characterization for the class of graphs that model mole...
. A simple way to calculate the number of k-matchings, k 5, in hexagonal systems is presented. Some...
AbstractSextet rotations of the perfect matchings of a hexagonal system H are represented by the sex...
Benzene is an important structure in chemistry due to its stability and the stability it can provide...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
Abstract. The vertex set of the resonance graph of a hexagonal graph G consists of 1-factors of G, t...
Di-4-catafusenes are defined as catacondensed polygonal systems consisting of two tetragons each and...
A polyene graph is a tree that can be embedded in a hexagonal lattice. Systems of polyene graphs att...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
AbstractAn edge of a generalized hexagonal system H is said to be not fixed if it belongs to some bu...
AbstractStarting with the major graph theoretical in variants of n = No. of vertices (points), q = N...
This paper presents some results of the first investigations on the application of the recently disc...