"Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs ..."

Drago Bokal et al. (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2019.14

access: open

type: Conference or Workshop Paper

metadata version: 2023-12-01

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/compgeom/BokalDHLMW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/BokalDHLMW19
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera:
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. SoCG 2019: 14:1-14:15

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.