On the Genus Polynomial of Cubic Graphs

Austin Ulrigg

The orientable genus polynomial of a graph counts its cellular embeddings by genus. For finite simple $2$-connected cubic graphs it is a cycle-matroid invariant: $M(G)\cong M(H)$ i…