A graph is called $n$-degenerate if each of its subgraphs has a vertex of degree at most $n$. For each $n$ the Lick-White number of graph $G$ is the fewest number of ...
We derive a closed-form expression for all genus 1 Hurwitz numbers, and give a simple new graph-theoretic interpretation of Hurwitz numbers in genus 0 and 1. (Hurwitz numbers essentially count ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback