Herbert Fleischner
Impact in
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
Papers in
-
- Advanced Graph Theory Research 70
- Complexity and Algorithms in Graphs 7
-
- Advanced Combinatorial Mathematics 6
- Limits and Structures in Graph Theory 4
- Finite Group Theory Research 2
- Co-authors
- Michael Stiebitz (3 shared papers)Bill Jackson (7 shared papers)Stefan Szeider (4 shared papers)Oliver Kullmann (1 shared paper)Arthur M. Hobbs (4 shared papers)Lars Andersen (3 shared papers)Gert Sabidussi (3 shared papers)Brendan D. McKay (1 shared paper)
- Journals
- Discrete Mathematics (13 papers)Journal of Graph Theory (8 papers)Journal of Combinatorial Theory Series B (8 papers)Discrete Applied Mathematics (5 papers)Mathematische Nachrichten (4 papers)
- Partner nations
- AustriaUnited StatesUnited Kingdom
In The Last Decade
Herbert Fleischner
71 papers receiving 818 citations
Peers
Comparison fields: 5 of 42
- Computational Theory and Mathematics 745
- Discrete Mathematics and Combinatorics 138
- Geometry and Topology 80
- Computer Networks and Communications 60
- Computer Graphics and Computer-Aided Design 7
Countries citing papers authored by Herbert Fleischner
This map shows the geographic impact of Herbert Fleischner's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Herbert Fleischner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Herbert Fleischner more than expected).
Fields of papers citing papers by Herbert Fleischner
This network shows the impact of papers produced by Herbert Fleischner. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Herbert Fleischner. The network helps show where Herbert Fleischner may publish in the future.
Co-authors
The 25 scholars most cited alongside Herbert Fleischner, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 76 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1974 | 116 | |
| 2 | 2002 | 72 | |
| 3 | 1992 | 58 | |
| 4 | 1976 | 36 | |
| 5 | 1976 | 34 | |
| 6 | 1974 | 31 | |
| 7 | 2008 | 31 | |
| 8 | 2009 | 30 | |
| 9 | 1988 | 29 | |
| 10 | Outerplanar Graphs and Weak Duals | 1974 | 27 |
| 11 | 1980 | 25 | |
| 12 | 1979 | 22 | |
| 13 | 2010 | 21 | |
| 14 | 1992 | 18 | |
| 15 | 1994 | 17 | |
| 16 | 1990 | 16 | |
| 17 | 2001 | 16 | |
| 18 | 2002 | 16 | |
| 19 | 1975 | 15 | |
| 20 | 1995 | 15 |
About Herbert Fleischner
Herbert Fleischner is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Theoretical Computer Science and Computer Graphics and Computer-Aided Design, having authored 76 papers that have together received 883 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (70 papers), Complexity and Algorithms in Graphs (7 papers), Advanced Combinatorial Mathematics (6 papers), Graph theory and applications (5 papers), Limits and Structures in Graph Theory (4 papers), Mathematics and Applications (3 papers), Finite Group Theory Research (2 papers) and History and Theory of Mathematics (1 paper). The work is most often cited by research in Computational Theory and Mathematics (745 citations), Discrete Mathematics and Combinatorics (138 citations), Geometry and Topology (80 citations), Computer Networks and Communications (60 citations) and Computer Graphics and Computer-Aided Design (7 citations). Herbert Fleischner has collaborated with scholars based in Austria, United States and United Kingdom. Frequent co-authors include Michael Stiebitz, Bill Jackson, Stefan Szeider, Oliver Kullmann, Arthur M. Hobbs, Lars Andersen, Gert Sabidussi, Brendan D. McKay, Frank Harary and Daniël Paulusma. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Journal of Combinatorial Theory Series B, Discrete Applied Mathematics and Mathematische Nachrichten.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.