Hal A. Kierstead
Impact in
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
- Computability, Logic, AI Algorithms
Papers in
-
- Limits and Structures in Graph Theory 40
- Advanced Combinatorial Mathematics 19
-
- Advanced Graph Theory Research 75
- Graph Labeling and Dimension Problems 18
- Complexity and Algorithms in Graphs 12
- Co-authors
- W. T. Trotter (18 shared papers)Alexandr V. Kostochka (16 shared papers)Gyula Y. Katona (1 shared paper)Genghua Fan (4 shared papers)Jarosław Grytczuk (4 shared papers)Ulrich Faigle (1 shared paper)André Kündgen (2 shared papers)Walter Kern (1 shared paper)
- Journals
- Discrete Mathematics (21 papers)Journal of Graph Theory (15 papers)Journal of Combinatorial Theory Series B (11 papers)European Journal of Combinatorics (7 papers)SIAM Journal on Discrete Mathematics (6 papers)
- Partner nations
- United StatesRussiaChina
In The Last Decade
Hal A. Kierstead
105 papers receiving 2.1k citations
Peers
Comparison fields: 5 of 36
- Discrete Mathematics and Combinatorics 810
- Computational Theory and Mathematics 1.6k
- Computer Networks and Communications 170
- Geometry and Topology 72
- Industrial and Manufacturing Engineering 23
Countries citing papers authored by Hal A. Kierstead
This map shows the geographic impact of Hal A. Kierstead'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 Hal A. Kierstead with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hal A. Kierstead more than expected).
Fields of papers citing papers by Hal A. Kierstead
This network shows the impact of papers produced by Hal A. Kierstead. 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 Hal A. Kierstead. The network helps show where Hal A. Kierstead may publish in the future.
Co-authors
The 25 scholars most cited alongside Hal A. Kierstead, 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 112 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1999 | 114 | |
| 2 | 1994 | 105 | |
| 3 | On the game chromatic number of some classes of graphs | 1991 | 104 |
| 4 | 2004 | 101 | |
| 5 | 1988 | 85 | |
| 6 | 1994 | 76 | |
| 7 | 2007 | 74 | |
| 8 | 2003 | 71 | |
| 9 | 2000 | 69 | |
| 10 | 2004 | 60 | |
| 11 | 1991 | 56 | |
| 12 | 2007 | 51 | |
| 13 | 1995 | 49 | |
| 14 | 2007 | 48 | |
| 15 | 1988 | 41 | |
| 16 | 1994 | 41 | |
| 17 | 2000 | 33 | |
| 18 | 1996 | 31 | |
| 19 | 1998 | 31 | |
| 20 | 2000 | 31 |
About Hal A. Kierstead
Hal A. Kierstead is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Networks and Communications, Geometry and Topology and Industrial and Manufacturing Engineering, having authored 112 papers that have together received 2.3k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (75 papers), Limits and Structures in Graph Theory (40 papers), Advanced Combinatorial Mathematics (19 papers), Graph Labeling and Dimension Problems (18 papers), Complexity and Algorithms in Graphs (12 papers), Optimization and Search Problems (7 papers), Advanced Topology and Set Theory (5 papers) and Advanced Banach Space Theory (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (810 citations), Computational Theory and Mathematics (1.6k citations), Computer Networks and Communications (170 citations), Geometry and Topology (72 citations) and Industrial and Manufacturing Engineering (23 citations). Hal A. Kierstead has collaborated with scholars based in United States, Russia and China. Frequent co-authors include W. T. Trotter, Alexandr V. Kostochka, Gyula Y. Katona, Genghua Fan, Jarosław Grytczuk, Ulrich Faigle, André Kündgen, Walter Kern, Michael O. Albertson and Andrzej Czygrinow. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Journal of Combinatorial Theory Series B, European Journal of Combinatorics and SIAM Journal on Discrete Mathematics.
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.