3-packings in Triangulations: Algorithms, bounds, and Complexity

Prosenjit Bose, Anil Maheshwari, Bobby Miraftab +1

We study $H$-packings in plane triangulations for the three-vertex graphs $H\in \{P_3,K_3,P_2\cup P_1\}$. For a graph $H$, let $\hat{I}{»}_H(G)$ denote the maximum size of an $H$-packing in…