Herbert Fleischner

1.3k total citations
64 papers, 616 citations indexed

About

Herbert Fleischner is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Herbert Fleischner has authored 64 papers receiving a total of 616 indexed citations (citations by other indexed papers that have themselves been cited), including 54 papers in Computational Theory and Mathematics, 26 papers in Geometry and Topology and 17 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Herbert Fleischner's work include Advanced Graph Theory Research (48 papers), Graph theory and applications (24 papers) and Graph Labeling and Dimension Problems (13 papers). Herbert Fleischner is often cited by papers focused on Advanced Graph Theory Research (48 papers), Graph theory and applications (24 papers) and Graph Labeling and Dimension Problems (13 papers). Herbert Fleischner collaborates with scholars based in Austria, United States and United Kingdom. Herbert Fleischner's co-authors include Michael Stiebitz, Stefan Szeider, Oliver Kullmann, Arthur M. Hobbs, Bill Jackson, Brendan D. McKay, Wilfried Imrich, Gert Sabidussi, Lars Andersen and J. Sheehan and has published in prestigious journals such as Chemical Physics Letters, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Herbert Fleischner

60 papers receiving 551 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Herbert Fleischner Austria 14 498 183 183 153 133 64 616
Charles Payan France 10 402 0.8× 116 0.6× 108 0.6× 88 0.6× 118 0.9× 27 481
Oriol Serra Spain 13 359 0.7× 338 1.8× 196 1.1× 220 1.4× 125 0.9× 91 617
Alexander Kelmans United States 11 396 0.8× 128 0.7× 306 1.7× 84 0.5× 110 0.8× 43 526
Geoffrey Exoo United States 12 424 0.9× 267 1.5× 238 1.3× 191 1.2× 171 1.3× 61 609
Jean‐Sébastien Sereni France 14 351 0.7× 155 0.8× 73 0.4× 142 0.9× 97 0.7× 57 478
Mehdi Behzad Iran 14 431 0.9× 120 0.7× 213 1.2× 110 0.7× 79 0.6× 22 531
R. E. L. Aldred New Zealand 13 465 0.9× 184 1.0× 131 0.7× 158 1.0× 118 0.9× 76 543
Michael O. Albertson United States 16 794 1.6× 353 1.9× 198 1.1× 155 1.0× 47 0.4× 56 903
Hikoe Enomoto Japan 17 635 1.3× 487 2.7× 300 1.6× 262 1.7× 141 1.1× 72 936
András Sebö France 11 593 1.2× 119 0.7× 161 0.9× 152 1.0× 106 0.8× 27 709

Countries citing papers authored by Herbert Fleischner

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Herbert Fleischner

This figure shows the co-authorship network connecting the top 25 collaborators of Herbert Fleischner. A scholar is included among the top collaborators of Herbert Fleischner based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Herbert Fleischner. Herbert Fleischner is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Fleischner, Herbert, et al.. (2018). Znovuobnovení hamiltonovského tématu v druhé mocnině bloku: případ DT-grafů. Digital Library (University of West Bohemia).
2.
Li, Ping, et al.. (2015). Supereulerian graphs with width s and s-collapsible graphs. Discrete Applied Mathematics. 200. 79–94. 6 indexed citations
3.
Fleischner, Herbert. (2013). Uniquely Hamiltonian Graphs of Minimum Degree 4. Journal of Graph Theory. 75(2). 167–177. 12 indexed citations
4.
Fleischner, Herbert, et al.. (2008). Hamiltonicity in vertex envelopes of plane cubic graphs. Discrete Mathematics. 309(14). 4793–4809. 1 indexed citations
5.
Fleischner, Herbert, Oliver Kullmann, & Stefan Szeider. (2002). Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoretical Computer Science. 289(1). 503–516. 46 indexed citations
6.
Fleischner, Herbert & Martin Kochol. (2002). A note about the dominating circuit conjecture. Discrete Mathematics. 259(1-3). 307–309. 3 indexed citations
7.
Horák, Peter, R. E. L. Aldred, & Herbert Fleischner. (2002). Completing Latin squares: Critical sets. Journal of Combinatorial Designs. 10(6). 419–432. 13 indexed citations
8.
Fleischner, Herbert. (2001). (Some of) the many uses of Eulerian graphs in graph theory (plus some applications). Discrete Mathematics. 230(1-3). 23–43. 13 indexed citations
9.
Fleischner, Herbert & Stefan Szeider. (2000). Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference. Electronic colloquium on computational complexity. 7. 4 indexed citations
10.
Andersen, Lars, et al.. (1998). Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs. Discrete Applied Mathematics. 85(2). 99–112. 4 indexed citations
11.
Andersen, Lars & Herbert Fleischner. (1995). The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs. Discrete Applied Mathematics. 59(3). 203–214. 6 indexed citations
12.
Fleischner, Herbert & Michael Stiebitz. (1992). A solution to a colouring problem of P. Erdős. Discrete Mathematics. 101(1-3). 39–48. 45 indexed citations
13.
Fleischner, Herbert & Bill Jackson. (1987). Compatible path-cycle-decompositions of plane graphs. Journal of Combinatorial Theory Series B. 42(1). 94–121. 4 indexed citations
14.
Fleischner, Herbert. (1986). Proof of the strong 2-Cover Conjecture for planar graphs. Journal of Combinatorial Theory Series B. 40(2). 229–230. 4 indexed citations
15.
Fleischner, Herbert. (1980). Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeiden. Journal of Combinatorial Theory Series B. 29(2). 145–167. 19 indexed citations
16.
Fleischner, Herbert & Wilfried Imrich. (1979). Transitive planar graphs. Mathematica Slovaca. 29(2). 97–106. 14 indexed citations
17.
Chvátal, Vašek, Herbert Fleischner, J. Sheehan, & Carsten Thomassen. (1979). Three‐regular subgraphs of four‐regular graphs. Journal of Graph Theory. 3(4). 371–386. 18 indexed citations
18.
Fleischner, Herbert & P.K. Roy. (1974). Distribution of points of odd degree of certain triangulations in the plane. Monatshefte für Mathematik. 78(5). 385–390. 5 indexed citations
19.
Fleischner, Herbert. (1974). The square of every two-connected graph is Hamiltonian. Journal of Combinatorial Theory Series B. 16(1). 29–34. 96 indexed citations
20.
Fleischner, Herbert. (1974). On Regulating Sets and the Disparity of Planar Cubic Graphs. Canadian Mathematical Bulletin. 17(3). 367–374. 1 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026