A Blass-Sagan bijection on Eulerian equivalence classes

Simple item page
dc.creatorChen, Beifang
dc.creatorYang, Arthur L. B.
dc.creatorZhang, Terence Y. J.
dc.date2007-06-22
dc.date.accessioned2026-07-07T08:11:51Z
dc.date.available2026-07-07T08:11:51Z
dc.descriptionFollowing 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.
dc.description10 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0706.3263
dc.identifierhttp://arxiv.org/abs/0706.3263
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132256
dc.subjectCombinatorics
dc.subject05A99, 05C20
dc.titleA Blass-Sagan bijection on Eulerian equivalence classes
dc.typetext

Files

Collections

arXiv