1. Cycles and paths in edge-colored graphs with given degrees;Abouelaoualim;J. Graph Theory,2010
2. Algorithms for Routing and Channel Assignment in Wireless Infrastructure Networks,;Ahuja,2010
3. Digraphs: Theory, Algorithms and Applications;Bang-Jensen,2009
4. On the complexity of finding alternating Hamiltonian and Eulerian cycles in edge-coloured graphs;Benkouar;Lecture Notes in Comput. Sci,1991
5. Note on Counting Eulerian Circuits. CDAM Research Report LSE-CDAM-2004-12;Brightwell,2004