Recognizing hyperelliptic graphs in polynomial time

DOI10.1007/978-3-030-00256-5_5OpenAlexW2708858069WikidataQ59567356 ScholiaQ59567356MaRDI QIDQ5915587

Hans L. Bodlaender, Jelco M. Bodewes, Marieke van der Wegen, Gunther Cornelissen

Publication date: 22 November 2018

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.05670

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Computing graph gonality is hard ⋮ Graphs of gonality three ⋮ Recognizing hyperelliptic graphs in polynomial time

This page was built for publication: Recognizing hyperelliptic graphs in polynomial time