16 citations · 52 across the 11 of their papers we have counts for
Showing 2009 · cs.DMShow all
2 papers · 2 filters
cs.DM2009★ 2 cited
Max-Leaves Spanning Tree is APX-hard for Cubic Graphs
Paul Bonsma
We consider the problem of finding a spanning tree with maximum number of leaves (MaxLeaf). A 2-approximation algorithm is known for this problem, and a 3/2-approximation algorithm…
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…