Michael A. Henning
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.02%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 402
- Graph Labeling and Dimension Problems 194
- Complexity and Algorithms in Graphs 163
-
- Limits and Structures in Graph Theory 115
- Co-authors
- Anders Yeo (51 shared papers)Teresa W. Haynes (67 shared papers)Wayne Goddard (41 shared papers)Stephen T. Hedetniemi (12 shared papers)Douglas F. Rall (12 shared papers)Christian Löwenstein (20 shared papers)Boštjan Brešar (10 shared papers)Johannes H. Hattingh (18 shared papers)
- Journals
- Discrete Mathematics (106 papers)Discrete Applied Mathematics (63 papers)Graphs and Combinatorics (33 papers)Journal of Combinatorial Optimization (25 papers)Journal of Graph Theory (23 papers)
- Partner nations
- South AfricaUnited StatesGermany
In The Last Decade
Michael A. Henning
399 papers receiving 4.8k citations
Michael A. Henning's Hit Papers
Peers
Comparison fields: 5 of 79
- Discrete Mathematics and Combinatorics 1.0k
- Computational Theory and Mathematics 4.9k
- Geometry and Topology 1.0k
- Computer Networks and Communications 1.3k
- Computer Graphics and Computer-Aided Design 64
Countries citing papers authored by Michael A. Henning
This map shows the geographic impact of Michael A. Henning'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 Michael A. Henning with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael A. Henning more than expected).
Fields of papers citing papers by Michael A. Henning
This network shows the impact of papers produced by Michael A. Henning. 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 Michael A. Henning. The network helps show where Michael A. Henning may publish in the future.
Co-authors
The 25 scholars most cited alongside Michael A. Henning, 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 439 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Total Domination in Graphs Hit paper breakdown → | 2013 | 276 |
| 2 | 2008 | 204 | |
| 3 | 2002 | 170 | |
| 4 | 2013 | 134 | |
| 5 | 2008 | 107 | |
| 6 | 2003 | 91 | |
| 7 | 2006 | 78 | |
| 8 | 2000 | 71 | |
| 9 | 2002 | 66 | |
| 10 | 2012 | 64 | |
| 11 | 2003 | 63 | |
| 12 | 2011 | 60 | |
| 13 | 2016 | 58 | |
| 14 | 2005 | 56 | |
| 15 | 2016 | 56 | |
| 16 | 2004 | 51 | |
| 17 | 2013 | 49 | |
| 18 | 2008 | 44 | |
| 19 | 2010 | 44 | |
| 20 | 2003 | 43 |
About Michael A. Henning
Michael A. Henning is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Networks and Communications, Geometry and Topology and Electrical and Electronic Engineering, having authored 439 papers that have together received 5.2k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (402 papers), Graph Labeling and Dimension Problems (194 papers), Complexity and Algorithms in Graphs (163 papers), Limits and Structures in Graph Theory (115 papers), Graph theory and applications (79 papers), Interconnection Networks and Systems (62 papers), graph theory and CDMA systems (43 papers) and Optimization and Search Problems (28 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.0k citations), Computational Theory and Mathematics (4.9k citations), Geometry and Topology (1.0k citations), Computer Networks and Communications (1.3k citations) and Computer Graphics and Computer-Aided Design (64 citations). Michael A. Henning has collaborated with scholars based in South Africa, United States and Germany. Frequent co-authors include Anders Yeo, Teresa W. Haynes, Wayne Goddard, Stephen T. Hedetniemi, Douglas F. Rall, Christian Löwenstein, Boštjan Brešar, Johannes H. Hattingh, Odile Favaron and Dieter Rautenbach. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Graphs and Combinatorics, Journal of Combinatorial Optimization and Journal of Graph Theory.
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.