A Blass-Sagan bijection on Eulerian equivalence classes
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
