John P. Georges
Impact in
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
-
- Limits and Structures in Graph Theory
Papers in
-
- Graph Labeling and Dimension Problems 18
- Advanced Graph Theory Research 17
- Complexity and Algorithms in Graphs 2
-
- graph theory and CDMA systems 13
- Co-authors
- David W. Mauro (18 shared papers)Melanie Stein (1 shared paper)David Erwin (1 shared paper)Yan Wang (1 shared paper)
- Journals
- SIAM Journal on Discrete Mathematics (4 papers)Discrete Mathematics (4 papers)Journal of Graph Theory (3 papers)Discrete Applied Mathematics (2 papers)Journal of Combinatorial Theory Series B (1 paper)
- Partner nations
- United StatesSouth KoreaIreland
In The Last Decade
John P. Georges
20 papers receiving 430 citations
Peers
Comparison fields: 5 of 23
- Computational Theory and Mathematics 492
- Discrete Mathematics and Combinatorics 73
- Electrical and Electronic Engineering 339
- Geometry and Topology 24
- Computer Graphics and Computer-Aided Design 8
Countries citing papers authored by John P. Georges
This map shows the geographic impact of John P. Georges'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 John P. Georges with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John P. Georges more than expected).
Fields of papers citing papers by John P. Georges
This network shows the impact of papers produced by John P. Georges. 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 John P. Georges. The network helps show where John P. Georges may publish in the future.
Co-authors
The 4 scholars most cited alongside John P. Georges, 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 21 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1995 | 123 | |
| 2 | 1994 | 95 | |
| 3 | 2001 | 89 | |
| 4 | 1996 | 45 | |
| 5 | 2002 | 42 | |
| 6 | 2002 | 27 | |
| 7 | 2003 | 19 | |
| 8 | 2005 | 10 | |
| 9 | 1996 | 9 | |
| 10 | Edge Labelings with a Condition at Distance Two. | 2004 | 8 |
| 11 | 1989 | 8 | |
| 12 | 1993 | 8 | |
| 13 | 2005 | 7 | |
| 14 | 1995 | 6 | |
| 15 | 2004 | 5 | |
| 16 | 2012 | 2 | |
| 17 | On Zero-Sum Zk-Magic Labelings of 3-Regular Graphs | 2013 | 2 |
| 18 | 2009 | 1 | |
| 19 | 2012 | 1 | |
| 20 | 2016 | 1 |
About John P. Georges
John P. Georges is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering, Computer Networks and Communications, Discrete Mathematics and Combinatorics and Political Science and International Relations, having authored 21 papers that have together received 508 indexed citations. Recurring topics across this work include Graph Labeling and Dimension Problems (18 papers), Advanced Graph Theory Research (17 papers), graph theory and CDMA systems (13 papers), Complexity and Algorithms in Graphs (2 papers), Blockchain Technology in Education and Learning (1 paper), Interconnection Networks and Systems (1 paper), Caching and Content Delivery (1 paper) and Electoral Systems and Political Participation (1 paper). The work is most often cited by research in Computational Theory and Mathematics (492 citations), Discrete Mathematics and Combinatorics (73 citations), Electrical and Electronic Engineering (339 citations), Geometry and Topology (24 citations) and Computer Graphics and Computer-Aided Design (8 citations). John P. Georges has collaborated with scholars based in United States, South Korea and Ireland. Frequent co-authors include David W. Mauro, Melanie Stein, David Erwin and Yan Wang. Their work appears in journals such as SIAM Journal on Discrete Mathematics, Discrete Mathematics, Journal of Graph Theory, Discrete Applied Mathematics and Journal of Combinatorial Theory Series B.
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.