8 citations · 16 across the 9 of their papers we have counts for
1 paper · 1 filter
Dalibor Froncek, William J. Keith, Donald L. Kreher
A nearly platonic graph is a k-regular simple planar graph in which all but a small number of the faces have the same degree. We show that it is impossible for a finite graph to ha…