Advanced search
Add to list

An efficient algorithm for the generation of planar polycyclic hydrocarbons with a given boundary

Gunnar Brinkmann (UGent) and Bart Coppens (UGent)
Author
Organization
Abstract
In this article we give an algorithm for the constructive enumeration of planar polycyclic hydrocarbons with hexagon rings and at most 5 pentagon rings that have a prescribed cyclic sequence of valencies of the boundary vertices.
Keywords
TRANSFORMATIONS, FULLERENE POLYHEDRA, ENUMERATION, PATCHES, CATALOG

Citation

Please use this url to cite or link to this publication:

MLA
Brinkmann, Gunnar, and Bart Coppens. “An Efficient Algorithm for the Generation of Planar Polycyclic Hydrocarbons with a given Boundary.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, vol. 62, no. 1, 2009, pp. 209–20.
APA
Brinkmann, G., & Coppens, B. (2009). An efficient algorithm for the generation of planar polycyclic hydrocarbons with a given boundary. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 62(1), 209–220.
Chicago author-date
Brinkmann, Gunnar, and Bart Coppens. 2009. “An Efficient Algorithm for the Generation of Planar Polycyclic Hydrocarbons with a given Boundary.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 62 (1): 209–20.
Chicago author-date (all authors)
Brinkmann, Gunnar, and Bart Coppens. 2009. “An Efficient Algorithm for the Generation of Planar Polycyclic Hydrocarbons with a given Boundary.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 62 (1): 209–220.
Vancouver
1.
Brinkmann G, Coppens B. An efficient algorithm for the generation of planar polycyclic hydrocarbons with a given boundary. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY. 2009;62(1):209–20.
IEEE
[1]
G. Brinkmann and B. Coppens, “An efficient algorithm for the generation of planar polycyclic hydrocarbons with a given boundary,” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, vol. 62, no. 1, pp. 209–220, 2009.
@article{525672,
  abstract     = {{In this article we give an algorithm for the constructive enumeration of planar polycyclic hydrocarbons with hexagon rings and at most 5 pentagon rings that have a prescribed cyclic sequence of valencies of the boundary vertices.}},
  author       = {{Brinkmann, Gunnar and Coppens, Bart}},
  issn         = {{0340-6253}},
  journal      = {{MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY}},
  keywords     = {{TRANSFORMATIONS,FULLERENE POLYHEDRA,ENUMERATION,PATCHES,CATALOG}},
  language     = {{eng}},
  number       = {{1}},
  pages        = {{209--220}},
  title        = {{An efficient algorithm for the generation of planar polycyclic hydrocarbons with a given boundary}},
  volume       = {{62}},
  year         = {{2009}},
}

Web of Science
Times cited: