Finding Fullerene Patches in Polynomial Time
From MaRDI portal
Publication:3652261
DOI10.1007/978-3-642-10631-6_76zbMath1272.05189OpenAlexW1955853588MaRDI QIDQ3652261
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_76
Related Items (3)
Counting hexagonal patches and independent sets in circle graphs ⋮ Counting symmetric and near-symmetric fullerene patches ⋮ Patches with short boundaries
This page was built for publication: Finding Fullerene Patches in Polynomial Time