A Blass-Sagan bijection on Eulerian equivalence classes
classification
🧮 math.CO
keywords
bijectionclassesequivalenceeulerianactivityalgorithmicblassblass-sagan
read the original abstract
Following the treatment of Blass and Sagan, we present an algorithmic bijection between the Eulerian equivalence classes of totally cyclic orientations and the spanning trees without internal activity edges for a given graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.