On the maximum number of edges of non-flowerable coin graphs

Geir Agnarsson, Jill Bigley Dunham

For $n\in\nats$ and $3\le k\le n$ we compute the exact value of $E_k(n)$, the maximum number of edges of a simple planar graph on $n$ vertices where each vertex bounds an $\ell$-…