"On the Size of Planarly Connected Crossing Graphs."

Eyal Ackerman, Balázs Keszegh, Máté Vizer (2016)

> Home

Details and statistics

DOI: 10.1007/978-3-319-50106-2_24

access: closed

type: Conference or Workshop Paper

metadata version: 2022-11-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/gd/AckermanKV16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gd/AckermanKV16
Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the Size of Planarly Connected Crossing Graphs. GD 2016: 311-320

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.