Reducing an arbitrary fullerene to the dodecahedron |
| |
Authors: | Herbert Fleischner |
| |
Institution: | Institute of Computer Graphics and Algorithms, Faculty of Informatics, TU Wien, Favoritenstraße 9-11, 1040 Vienna, Austria |
| |
Abstract: | Viewing fullerenes as plane graphs with facial cycles being pentagonal and hexagonal only, it is shown how to reduce an arbitrary fullerene to the (graph of the) dodecahedron. This can be achieved by a sequence of eight reduction steps, seven of which are local operations and the remaining reduction step acts globally. In any case, the resulting algorithm has polynomial running time. |
| |
Keywords: | Fullerenes Fullerene graphs Planar graphs |
本文献已被 ScienceDirect 等数据库收录! |
|