Keyword

Eulerian digraphs

Description: Directed graphs in which every vertex has equal indegree and outdegree, allowing an Euler circuit when the graph is connected appropriately.
OpenAlex ID: keywords/eulerian-digraphs
2003 · Jarkko Kari · Theoretical Computer Science · 167
2003 · Simone Severini · SIAM Journal on Matrix Analysis and Applications · 73
1988 · A. Frank · Annals of discrete mathematics · 50
2001 · Jarkko Kari · Lecture notes in computer science · 43
1996 · P. D. Seymour · COMBINATORICA · 39
1986 · Linda Lesniak, Ortrud R. Oellermann · Journal of Graph Theory · 32
2003 · PAUL BALISTER · Combinatorics Probability Computing · 31
2002 · C.Paul Bonnington, Marston Conder, et al. · Journal of Combinatorial Theory Series B · 31
1982 · Saul Stahl · Transactions of the American Mathematical Society · 26
1991 · T. Ibaraki, S. Poljak · SIAM Journal on Discrete Mathematics · 25
2013 · Matt DeVos, Jessica McDonald, et al. · The Electronic Journal of Combinatorics · 23
2003 · Joanna A. Ellis-Monaghan · Advances in Applied Mathematics · 23
2022 · Yuefang Sun, Anders Yeo · Journal of Graph Theory · 21
2018 · Lucas Boczkowski, Yuval Peres, et al. · SIAM Journal on Discrete Mathematics · 21
2015 · Viktor Kiss, Lilla Tóthmérész · Discrete Applied Mathematics · 21
1990 · H. Fleischner, B. Jackson · Springer eBooks · 21
2018 · H. M. Nagesh, M. C. Mahesh Kumar · Open Journal of Mathematical Sciences · 19
2013 · HAO HUANG, JIE MA, et al. · Combinatorics Probability Computing · 18
2012 · Matt DeVos, Jessica McDonald, et al. · European Journal of Combinatorics · 18
2022 · Yuefang Sun, Gregory Gutin, et al. · Discrete Optimization · 17
2004 · C Paul Bonnington, Nora Hartsfield, et al. · European Journal of Combinatorics · 17
Works count: 166
Citation count: 1,372
Year
Topic
Type