On Triangulating Planar Graphs under the Four-Connectivity Constraint
- 1 December 1997
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 19 (4) , 427-446
- https://doi.org/10.1007/pl00009182
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002