✦ LIBER ✦

An improved method of constructive enumeration of graphs

✍ Scribed by V. Kvasnička; J. Pospíchal

Publisher: Springer
Year: 1992
Tongue: English
Weight: 953 KB
Volume: 9
Category: Article
ISSN: 0259-9791
DOI: 10.1007/bf01164843

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Constructive Enumeration of Fullerenes

✍ Gunnar Brinkmann; Andreas W.M. Dress 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 215 KB

In this paper, a fast and complete method to enumerate fullerene structures is given. It is based on a top-down approach, and it is fast enough to generate, for example, all 1812 isomers of C in less than 20 s on an SGI-workstation. The 60 method described can easily be generalized for 3-regular sph

Constructive enumeration of Boolean latt

Constructive enumeration of Boolean lattices

✍ V. D. Dzgoev 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 438 KB

A Constructive Enumeration of Meanders

✍ Reinhard O.W. Franz; Berton A. Earnshaw 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 129 KB

An improved method of enumerating all tr

An improved method of enumerating all trees and minimal paths in a graph using Petri nets

✍ J.M. Kontoleon; D. Mandaltsis 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Enumeration of packed graphs

✍ Iwao Sato 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 181 KB

Enumeration of generalized graphs

✍ N.G de Bruijn; D.A Klarner 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 546 KB