Making triangulations 4-connected using flips

Prosenjit Bose, Dana Jansens, André van Renssen +2

We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one using at most floor((3n - 9)/5) edge flips. We also give an example of an infin…