Therese C. Biedl, Goos Kant, Michael Kaufmann. On Triangulating Planar Graphs Under the Four-Connectivity Constraint. Algorithmica, 19(4):427-446, 1997.
@article{BiedlKK97,
title = {On Triangulating Planar Graphs Under the Four-Connectivity Constraint},
author = {Therese C. Biedl and Goos Kant and Michael Kaufmann},
year = {1997},
tags = {constraints, planar graph, graph-rewriting, C++, rewriting},
researchr = {https://researchr.org/publication/BiedlKK97},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {19},
number = {4},
pages = {427-446},
}