A new vertex polynomial for ribbon graphs tracks vertex counts over ribbon group orbits, and for bouquets it depends only on the signed intersection graph.
Bouchet, Greedy algorithm and symmetric matroids,Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Introducing a vertex polynomial invariant for embedded graphs
A new vertex polynomial for ribbon graphs tracks vertex counts over ribbon group orbits, and for bouquets it depends only on the signed intersection graph.