Keyword

Eulerian paths

Description: Trails in graph theory that traverse every edge of a graph exactly once, with vertices allowed to occur more than once.
Wikidata ID: wiki/Q624580
OpenAlex ID: keywords/eulerian-paths
2001 · Pavel A. Pevzner, Haixu Tang, et al. · Proceedings of the National Academy of Sciences · 1,614
1995 · Michel Gondran, Michel Minoux · CERN Document Server (European Organization for Nuclear Research) · 335
2003 · Lorenza Viola, Emanuel Knill · Physical Review Letters · 333
2016 · Jang-il Sohn, Jin-Wu Nam · Briefings in Bioinformatics · 286
2006 · Gerald Alexanderson · Bulletin of the American Mathematical Society · 146
1941 · W. T. Tutte, C. A. B. Smith · American Mathematical Monthly · 138
2022 · Garrett, Henry · UNM’s Digital Repository (University of New Mexico) · 121
1984 · James B. Orlin · Elsevier eBooks · 64
2023 · Garrett, Henry · Zenodo (CERN European Organization for Nuclear Research) · 52
2023 · Garrett, Henry · Zenodo (CERN European Organization for Nuclear Research) · 52
2023 · Garrett, Henry · Zenodo (CERN European Organization for Nuclear Research) · 52
2023 · Garrett, Henry · Zenodo (CERN European Organization for Nuclear Research) · 50
2005 · Yu Zhang, Michael S. Waterman · Proceedings of the National Academy of Sciences · 46
1986 · Robin J. Wilson · Journal of Graph Theory · 46
2010 · Vamsi K Kundeti, Sanguthevar Rajasekaran, et al. · BMC Bioinformatics · 41
2003 · Yu Zhang, Michael S. Waterman · Journal of Computational Biology · 36
1996 · Sridhar Hannenhalli, William Feldman, et al. · Computer applications in the biosciences · 36
2022 · Garrett, Henry · Zenodo (CERN European Organization for Nuclear Research) · 35
2016 · Ilan Shomorony, Samuel H Kim, et al. · Bioinformatics · 35
2009 · Michel Boyer, Dan Kenigsberg, et al. · Physical Review Letters · 32
Works count: 379
Citation count: 4,580
Year
Topic
Type