2 citations · 5 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2009★ 2 cited
Finding Fullerene Patches in Polynomial Time
Paul Bonsma, Felix Breuer
We consider the following question, motivated by the enumeration of fullerenes. A fullerene patch is a 2-connected plane graph G in which inner faces have length 5 or 6, non-bounda…
cs.DM2008★ 1 cited
Counting Hexagonal Patches and Independent Sets in Circle Graphs
Paul Bonsma, Felix Breuer
A hexagonal patch is a plane graph in which inner faces have length 6, inner vertices have degree 3, and boundary vertices have degree 2 or 3. We consider the following counting pr…