1 paper · 1 filter
Therese Biedl, John Wittnebel
It is well-known that every maximal planar graph has a matching of size at least 3n+8 if n≥14. In this paper, we investigate similar matching-bounds for maximal \…