Enumerative Graph Theory
Enumerative Graph Theory is a branch of graph theory that focuses on the exact counting of graphs or graph properties, distinguished by its use of combinatorial methods to systematically enumerate graph structures according to specified criteria.
1.1K
Publications
42.7K
Citations
1.7K
Authors
800
Institutions
Publications per year
2017–2026
114
Parents
1.1K
Easy problems for tree-decomposable graphs
Stefan Arnborg, Jens Lagergren, Detlef Seese · Journal of Algorithms · 1991 · 874 citations
W. T. Tutte · Canadian Journal of Mathematics · 1963 · 687 citations · Full text
Quantum field theory techniques in graphical enumeration
D. Bessis, C. Itzykson, J.B. Zuber · Advances in Applied Mathematics · 1980 · 600 citations
Optimal numberings and isoperimetric problems on graphs
L. H. Harper · Journal of Combinatorial Theory · 1966 · 466 citations
1–5 of 1.1K
1.7K
12
h-index
10
h-index
10
h-index
9
h-index
8
h-index
1–5 of 1.7K
800

University of Ljubljana
Ljubljana, Slovenia
21 h-index
46 publications
2.4K citations

Centre National de la Recherche Scientifique
Paris, France
19 h-index
36 publications
1.1K citations

Hungarian Academy of Sciences
Budapest, Hungary
16 h-index
25 publications
1.3K citations

University of Waterloo
Waterloo, Canada
14 h-index
21 publications
1.3K citations
Institute of Mathematics, Physics, and Mechanics
Ljubljana, Slovenia
14 h-index
26 publications
1.5K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
12 h-index
20 publications
697 citations

University of Maribor
Maribor, Slovenia
12 h-index
21 publications
941 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
11 h-index
15 publications
614 citations
1–8 of 800
167 publications · 4.4K citations
33
h-index
69 publications · 2.8K citations
32
h-index
78 publications · 2.6K citations
29
h-index
65 publications · 2.2K citations
24
h-index
33 publications · 1.1K citations
20
h-index
1–5