Crossmark

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

Crossref DOI link: https://doi.org/10.1007/s00453-019-00555-y

Published Online: 2019-03-02

Published Print: 2019-07

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Golovach, Petr A. https://orcid.org/0000-0002-2619-2990
Heggernes, Pinar

Kratsch, Dieter

Lima, Paloma T.

Paulusma, Daniël
Funding

Funding for this research was provided by:

Norges Forskningsråd (249994, 249994)

Norges Forskningsråd (249994)

Leverhulme Trust (RPG-2016-258)
License Information

Text and Data Mining valid from 2019-03-02
More Information

Article History

Received: 2 March 2018

Accepted: 22 February 2019

First Online: 2 March 2019