On the gonality, treewidth, and orientable genus of a graph
James Stankewicz

TL;DR
This paper explores relationships between graph gonality, treewidth, and genus, revealing that hyperelliptic graphs are planar and introducing bielliptic graphs that embed into genus-one surfaces, along with constructions for graphs of higher gonality.
Contribution
It establishes new connections between gonality, treewidth, and genus, including classifications of hyperelliptic and bielliptic graphs and constructions for graphs of higher gonality.
Findings
Hyperelliptic graphs are planar.
Bielliptic graphs embed into genus-one surfaces.
Existence of trigonal graphs with specified properties for all g ≥ 0.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Advanced Combinatorial Mathematics
