A Blass-Sagan bijection on Eulerian equivalence classes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
10 pages, 2 figures

Keywords

Combinatorics, 05A99, 05C20

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/132256

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0706.3263
 http://arxiv.org/abs/0706.3263

Collections

arXiv