On the gonality, treewidth, and orientable genus of a graph
Number Theory
2017-04-21 v1 Algebraic Geometry
Combinatorics
Abstract
We examine connections between the gonality, treewidth, and orientable genus of a graph. Especially, we find that hyperelliptic graphs in the sense of Baker and Norine are planar. We give a notion of a bielliptic graph and show that each of these must embed into a closed orientable surface of genus one. We also find, for all , trigonal graphs of treewidth 3 and orientable genus , and give analogues for graphs of higher gonality.
Keywords
Cite
@article{arxiv.1704.06255,
title = {On the gonality, treewidth, and orientable genus of a graph},
author = {James Stankewicz},
journal= {arXiv preprint arXiv:1704.06255},
year = {2017}
}
Comments
10 pages, comments welcome!