Eulerian Graphs
An Eulerian Graph is a connected graph in which every vertex has even degree, distinguishing it from other connected graphs by admitting a closed trail that traverses every edge exactly once.
227
Publications
8.6K
Citations
367
Authors
216
Institutions
Publications per year
2017–2026
16
Parents
227
Choice Reviews Online · 2005 · 657 citations
A reduction method to find spanning Eulerian subgraphs
Paul A. Catlin · Journal of Graph Theory · 1988 · 233 citations
1–5 of 227
367
9
h-index
7
h-index
6
h-index
5
h-index
4
h-index
1–5 of 367
216
West Virginia University
Morgantown, United States
10 h-index
12 publications
260 citations
University of Southern California
Los Angeles, United States
5 h-index
8 publications
239 citations

University of Ljubljana
Ljubljana, Slovenia
5 h-index
8 publications
175 citations

Goldsmiths University of London
London, United Kingdom
5 h-index
5 publications
111 citations
University of Brighton
Brighton, United Kingdom
4 h-index
9 publications
163 citations

Cornell University
Ithaca, United States
4 h-index
8 publications
370 citations
Wayne State University
Detroit, United States
4 h-index
4 publications
288 citations
Austrian Academy of Sciences
Vienna, Austria
4 h-index
4 publications
68 citations
1–8 of 216
26 publications · 1.3K citations
18
h-index
20 publications · 468 citations
16
h-index
15 publications · 573 citations
12
h-index
12 publications · 298 citations
12
h-index
7 publications · 227 citations
7
h-index
1–5