A Blass-Sagan bijection on Eulerian equivalence classes
Combinatorics
2007-06-25 v1
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.
Keywords
Cite
@article{arxiv.0706.3263,
title = {A Blass-Sagan bijection on Eulerian equivalence classes},
author = {Beifang Chen and Arthur L. B. Yang and Terence Y. J. Zhang},
journal= {arXiv preprint arXiv:0706.3263},
year = {2007}
}