On triangulating planar graphs under the four-connectivity constraint

Therese C. Biedl, Goos Kant, and Michael Kaufmann
Algorithmica 19(4):427–446, Dec 1997
http://link.springer.de/link/service/journals/00453/bibs/19n4p427.html

Cites:

Subgraph isomorphism in planar graphs and related problems

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine