Mathematics – Combinatorics
Scientific paper
2007-06-22
Mathematics
Combinatorics
10 pages, 2 figures
Scientific paper
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.
Chen Beifang
Yang Arthur L. B.
Zhang Terence Y. J.
No associations
LandOfFree
A Blass-Sagan bijection on Eulerian equivalence classes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Blass-Sagan bijection on Eulerian equivalence classes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Blass-Sagan bijection on Eulerian equivalence classes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-187463