Add to ORKGDi-4-catafusenes are defined as catacondensed polygonal systems consisting of two tetragons each and otherwise only hexagons. Di- 4-catafusenes are enumerated by combinatorial constructions and by computer programming. For the unbranched systems (nonhelicenic + helicenic), as the main result of the present work, a complete mathematical solution is reported. A new algebraic approach has been employed, which involves a triangular matrix with some interesting mathematical properties
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
Kuck D, Krause RA, Gestmann D, Posteher F, Schuster A. Polycyclic compounds beyond the propellanes a...
AbstractThis paper revisits the existence and construction problems for polygonal designs (a special...
Di-4-catafusenes are defined as catacondensed polygonal systems consisting of two tetragons each and...
An algebraic solution for the isomer numbers of unbranched a-4- catafusenes is presented. An a-4-cat...
AbstractThis paper provides a combinatorial characterization for the class of graphs that model mole...
Abstract. Hexagonal systems are geometric objects obtained by arranging mu-tually congruent regular ...
AbstractPolygonal systems Pq, which consist solely of q-gons, are considered. A Pq system correspond...
This paper describes a rather efficient algorithm that enumerates nonisomorphic geometrically planar...
A polyene graph is a tree that can be embedded in a hexagonal lattice. Systems of polyene graphs att...
In this article we give an algorithm for the constructive enumeration of planar polycyclic hydrocarb...
A modified definition is proposed for cata-condensed aromatic hydrocarbons. A formula is devised for...
Catacondensed benzenoids (those benzenoids having no carbon atom belonging to three hexagonal rings)...
Enumeration of graphs of polycyclic unbranched pentahexagonal catacondensed systems is considered. A...
Characterization of the honeycomb or polyhex networks is of particular interest, not only from the v...
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
Kuck D, Krause RA, Gestmann D, Posteher F, Schuster A. Polycyclic compounds beyond the propellanes a...
AbstractThis paper revisits the existence and construction problems for polygonal designs (a special...
Di-4-catafusenes are defined as catacondensed polygonal systems consisting of two tetragons each and...
An algebraic solution for the isomer numbers of unbranched a-4- catafusenes is presented. An a-4-cat...
AbstractThis paper provides a combinatorial characterization for the class of graphs that model mole...
Abstract. Hexagonal systems are geometric objects obtained by arranging mu-tually congruent regular ...
AbstractPolygonal systems Pq, which consist solely of q-gons, are considered. A Pq system correspond...
This paper describes a rather efficient algorithm that enumerates nonisomorphic geometrically planar...
A polyene graph is a tree that can be embedded in a hexagonal lattice. Systems of polyene graphs att...
In this article we give an algorithm for the constructive enumeration of planar polycyclic hydrocarb...
A modified definition is proposed for cata-condensed aromatic hydrocarbons. A formula is devised for...
Catacondensed benzenoids (those benzenoids having no carbon atom belonging to three hexagonal rings)...
Enumeration of graphs of polycyclic unbranched pentahexagonal catacondensed systems is considered. A...
Characterization of the honeycomb or polyhex networks is of particular interest, not only from the v...
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
Kuck D, Krause RA, Gestmann D, Posteher F, Schuster A. Polycyclic compounds beyond the propellanes a...
AbstractThis paper revisits the existence and construction problems for polygonal designs (a special...