Dec 2, 2008 · We note that the concept of cycle reversing classes of orientations coincides with that of Eulerian-equivalence classes considered by Chen and ...

Abstract. Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the ...

Nov 1, 2008 · We note that the concept of cycle reversing classes of orientations coincides with that of Eulerian-equivalence classes considered by Chen and ...

Jun 22, 2007 · Abstract. Following the treatment of Blass and Sagan, we present an algorithmic bijection between the Eulerian equivalence classes of ...

Following the treatment of Blass and Sagan, we present an algorithmic bijection between the Eulerian equivalence classes of totally cyclic orientations and ...

Jun 22, 2007 · Abstract: Following the treatment of Blass and Sagan, we present an algorithmic bijection between the Eulerian equivalence classes of ...

Following the treatment of Blass and Sagan, we present an algorithmic bijection between the Eulerian equivalence classes of totally cyclic orientations and ...

... a bijective proof of the following theorem on the enumeration of Eulerian-equivalence classes of totally cyclic orientations. Theorem 1. [9] For any graph G ...

We note that the concept of cycle reversing classes of orientations coincides with that of Eulerian-equivalence classes considered by Chen and Stanley, and ...

We introduce canonical forms that represent certain equivalence classes of totally cyclic and acyclic orientations of graphs and present a polynomial algorithms ...