@InProceedings{hoffmann_et_al:LIPIcs.ESA.2019.58,
author = {Hoffmann, Michael and Klemz, Boris},
title = {{Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian}},
booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)},
pages = {58:1--58:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-124-5},
ISSN = {1868-8969},
year = {2019},
volume = {144},
editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.58},
URN = {urn:nbn:de:0030-drops-111797},
doi = {10.4230/LIPIcs.ESA.2019.58},
annote = {Keywords: Graph drawing, book embedding, Hamiltonian graph, planar graph, bounded degree graph, graph augmentation, computational geometry, SPQR decomposition}
}