John Gimbel

549 total citations
30 papers, 266 citations indexed

About

John Gimbel is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, John Gimbel has authored 30 papers receiving a total of 266 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 14 papers in Discrete Mathematics and Combinatorics and 8 papers in Geometry and Topology. Recurrent topics in John Gimbel's work include Advanced Graph Theory Research (26 papers), Graph Labeling and Dimension Problems (19 papers) and Limits and Structures in Graph Theory (13 papers). John Gimbel is often cited by papers focused on Advanced Graph Theory Research (26 papers), Graph Labeling and Dimension Problems (19 papers) and Limits and Structures in Graph Theory (13 papers). John Gimbel collaborates with scholars based in United States, Czechia and Denmark. John Gimbel's co-authors include Carsten Thomassen, Jayme L. Szwarcfiter, Jan Kratochvı́l, Fábio Protti, Mitre C. Dourado, Ann N. Trenk, Jaroslav Nešetřil, Preben Dahl Vestergaard, Tınaz Ekim and Lorna Stewart and has published in prestigious journals such as SHILAP Revista de lepidopterología, Transactions of the American Mathematical Society and Discrete Applied Mathematics.

In The Last Decade

John Gimbel

28 papers receiving 244 citations

Peers

John Gimbel
André Kündgen United States
Alexander Soifer United States
John Mitchem United States
Bert Gerards Netherlands
Robert Cowen United States
Vera Rosta Hungary
John Gimbel
Citations per year, relative to John Gimbel John Gimbel (= 1×) peers Arnfried Kemnitz

Countries citing papers authored by John Gimbel

Since Specialization
Citations

This map shows the geographic impact of John Gimbel'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 Gimbel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Gimbel more than expected).

Fields of papers citing papers by John Gimbel

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by John Gimbel. 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 Gimbel. The network helps show where John Gimbel may publish in the future.

Co-authorship network of co-authors of John Gimbel

This figure shows the co-authorship network connecting the top 25 collaborators of John Gimbel. A scholar is included among the top collaborators of John Gimbel 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 John Gimbel. John Gimbel 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.
Gimbel, John, et al.. (2021). On Graphs with Proper Connection Number 2. SHILAP Revista de lepidopterología. 8(2). 1 indexed citations
2.
Ekim, Tınaz, et al.. (2019). Small 1-defective Ramsey numbers in perfect graphs. Discrete Optimization. 34. 100548–100548. 2 indexed citations
3.
Gimbel, John, et al.. (2019). Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces. SIAM Journal on Discrete Mathematics. 33(3). 1415–1430. 1 indexed citations
4.
Gimbel, John, et al.. (2011). On cycle packings and feedback vertex sets. Contributions to Discrete Mathematics. 9(2). 2 indexed citations
5.
Esperet, Louis, John Gimbel, & Andrew D. King. (2010). Covering line graphs with equivalence relations. Discrete Applied Mathematics. 158(17). 1902–1907. 1 indexed citations
6.
Gimbel, John & Jaroslav Nešetřil. (2010). Partitions of graphs into cographs. Discrete Mathematics. 310(24). 3437–3445. 6 indexed citations
7.
Gimbel, John, et al.. (2008). Bounds on the metric and partition dimensions of a graph. Ars Combinatoria. 88. 43 indexed citations
8.
Dourado, Mitre C., John Gimbel, Jan Kratochvı́l, Fábio Protti, & Jayme L. Szwarcfiter. (2008). On the computation of the hull number of a graph. Discrete Mathematics. 309(18). 5668–5674. 55 indexed citations
9.
Ekim, Tınaz & John Gimbel. (2008). Partitioning graphs into complete and empty graphs. Discrete Mathematics. 309(19). 5849–5856. 4 indexed citations
10.
Gimbel, John, et al.. (2003). Subcolorings and the subchromatic number of a graph. Discrete Mathematics. 272(2-3). 139–154. 11 indexed citations
11.
Gimbel, John. (2003). Some Remarks on the Convexity Number of a Graph. Graphs and Combinatorics. 19(3). 357–361. 12 indexed citations
12.
Gimbel, John & Ping Zhang. (2001). Degree-Continuous Graphs. Czechoslovak Mathematical Journal. 51(1). 163–171. 1 indexed citations
13.
Gimbel, John, et al.. (1999). Even And Odd Pairs In Comparability And In P4-comparability Graphs. Scopus. 1 indexed citations
14.
Gimbel, John & Ann N. Trenk. (1998). On the Weakness of an Ordered Set. SIAM Journal on Discrete Mathematics. 11(4). 655–663. 12 indexed citations
15.
Gimbel, John, et al.. (1997). Double total domination of graphs. Discrete Mathematics. 165-166. 343–351. 3 indexed citations
16.
Gimbel, John & Carsten Thomassen. (1997). Coloring graphs with fixed genus and girth. Transactions of the American Mathematical Society. 349(11). 4555–4564. 43 indexed citations
17.
Gimbel, John & Preben Dahl Vestergaard. (1995). Inequalities for total matchings of graphs. Ars Combinatoria. 39. 109–119. 11 indexed citations
18.
Gimbel, John, Dieter Kratsch, & Lorna Stewart. (1994). On cocolourings and cochromatic numbers of graphs. Discrete Applied Mathematics. 48(2). 111–127. 15 indexed citations
19.
Gimbel, John, et al.. (1987). Some topics in cochromatic theory. Graphs and Combinatorics. 3(1). 255–265. 7 indexed citations
20.
Gimbel, John, et al.. (1985). Homogeneously representable interval graphs. Discrete Mathematics. 55(2). 213–216. 5 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