Recognizing hyperelliptic graphs in polynomial time

DOI10.1007/978-3-030-00256-5_5MaRDI QIDQ5915587zbMATH OpenOpenAlexWikidataFDO

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

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, https://dspace.library.uu.nl/handle/1874/395476

Mathematics Subject Classification ID

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

Recommendations

• Recognizing hyperelliptic graphs in polynomial time
• On the gonality of graphs and connections to orientable genus
• Stable gonality is computable
• On -hyperellipticity of graphs
• Computing graph gonality is hard

Cited in

(6)

• Computing graph gonality is hard
• Recognizing generalized Petersen graphs in linear time
• Graphs of gonality three
• Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
• scientific article; zbMATH DE number 942492 (Why is no real title available?)
• Recognizing hyperelliptic graphs in polynomial time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915587)