"Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2."

Petr A. Golovach et al. (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-68705-6_21

access: closed

type: Conference or Workshop Paper

metadata version: 2020-10-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/GolovachHKLP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/GolovachHKLP17
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma:
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. WG 2017: 275-288

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.