Generalizes subgraph-orientation equinumerosities to arbitrary connectivity constraint sets A and B on graphs, plus extensions to equivalence classes under cycle or cocycle reversals.
Bernardi and ´Eric Fusy
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Subgraphs versus Orientations: Infinite families of equidistributions
Generalizes subgraph-orientation equinumerosities to arbitrary connectivity constraint sets A and B on graphs, plus extensions to equivalence classes under cycle or cocycle reversals.