Author:
Hanada Hiroyuki,Denzumi Shuhei,Inoue Yuma,Aoki Hiroshi,Yasuda Norihito,Takeuchi Shogo,Minato Shin-ichi
Publisher
Springer International Publishing
Reference19 articles.
1. Wilson, R.J.: Introduction to Graph Theory, 4th edn. Pearson Education (1996)
2. Harary, F.: Graph Theory, 1st edn. Addison-Wesley (1969)
3. Mihail, M., Winkler, P.: On the number of Eulerian orientations of a graph. In: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1992, pp. 138–145 (1992)
4. Creed, P.: Sampling Eulerian orientations of triangular lattice graphs. Journal of Discrete Algorithms 7(2), 168–180 (2009)
5. Ge, Q., Štefankovič, D.: The complexity of counting Eulerian tours in 4-regular graphs. Algorithmica 63(3), 588–601 (2012)