𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Enumeration of 2-Factors of Polyhexes

✍ Scribed by J. V. Knop; W. R. Müller; K. Szymanski; N. Trinajstić

Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
822 KB
Volume
7
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis

An algorithm is developed for enumerating all 2-factors of polyhexes. Some properties of 2-factors of polyhexes are discussed.

📜 SIMILAR VOLUMES

On the enumeration and generation of pol
On the enumeration and generation of polyhex hydrocarbons
✍ W. R. Müller; K. Szymanski; J. V. Knop; S. Nikolić; N. Trinajstić 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 805 KB

## Abstract A novel efficient computer‐oriented approach, based on the DAST (dualist angle‐restricted spanning tree) code, is introduced for enumeration and generation of planar polyhex hydrocarbons. It is much faster than other approaches in the literature. The numbers of planar polyhex hydrocarbo

Computer enumeration of polyhexes using
Computer enumeration of polyhexes using the compact naming approach
✍ J. Cioslowski 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 651 KB

The enumeration of polyhexes can be easily carried out by utilizing a compact name (CN) approach to code chemical structures. The Fortran program performing generation of benzenoid hydrocarbons with 1-10 rings is presented. The computed structures are divided into various classes according to their

Enumeration of 2 -connected Loopless 4 -
Enumeration of 2 -connected Loopless 4 -regular Maps on the Plane
✍ Han Ren; Yanpei Liu; Zhaoxiang Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 195 KB

In this paper rooted (near-) 4-regular maps on the plane are counted with respect to the root-valency, the number of edges, the number of inner faces, the number of non-root vertex loops, the number of non-root vertex blocks, and the number of multi-edges. As special cases, formulae of several types