"On Triangulating Planar Graphs Under the Four-Connectivity Constraint."

Therese Biedl, Goos Kant, Michael Kaufmann (1997)

> Home

Details and statistics

DOI: 10.1007/PL00009182

access: closed

type: Journal Article

metadata version: 2024-07-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BiedlKK97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BiedlKK97
Therese Biedl, Goos Kant, Michael Kaufmann:
On Triangulating Planar Graphs Under the Four-Connectivity Constraint. Algorithmica 19(4): 427-446 (1997)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.