1 paper · 1 filter
Mikhail Kabenyuk
A planar graph G is called a pentagulation of an n-gon (n≥ is an integer) if all faces of G are pentagons, except one, which is an n-gon. A 3-connected pentagulation…