Polynomial invariants of cyclically ordered graphs
Cyclically ordered graphs, or cogs, sit between abstract graphs and cellularly embedded graphs. They arise naturally in topological graph theory, knot theory, and mathematical biology. We develop a formal theory of cogs and establish a number of invariants of cogs. In particular we detail several ways to present cogs and detail how these descriptions can be used to construct cog invariants by adapting the matching, transition and Yamada polynomials.
math.CO↗