J. A. Bondy

15.6k total citations · 2 hit papers
68 papers, 10.1k citations indexed

About

J. A. Bondy is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, J. A. Bondy has authored 68 papers receiving a total of 10.1k indexed citations (citations by other indexed papers that have themselves been cited), including 51 papers in Computational Theory and Mathematics, 37 papers in Discrete Mathematics and Combinatorics and 29 papers in Geometry and Topology. Recurrent topics in J. A. Bondy's work include Advanced Graph Theory Research (49 papers), Limits and Structures in Graph Theory (31 papers) and Graph theory and applications (23 papers). J. A. Bondy is often cited by papers focused on Advanced Graph Theory Research (49 papers), Limits and Structures in Graph Theory (31 papers) and Graph theory and applications (23 papers). J. A. Bondy collaborates with scholars based in Canada, France and United States. J. A. Bondy's co-authors include U. S. R. Murty, Vašek Chvátal, Miklós Simonovits, Robert L. Hemminger, W. T. Tutte, A. W. Ingleton, Pavol Hell, P. Erdös, Stephen C. Locke and Dominic Welsh and has published in prestigious journals such as Annals of the New York Academy of Sciences, Pacific Journal of Mathematics and Proceedings of the American Mathematical Society.

In The Last Decade

J. A. Bondy

65 papers receiving 9.2k citations

Hit Papers

Graph Theory with Applications 1976 2026 1992 2009 1976 2008 2.0k 4.0k 6.0k

Peers

J. A. Bondy
P. Erdös Hungary
Gary Chartrand United States
Paul Seymour United States
Richard A. Brualdi United States
Joel Spencer United States
J. A. Bondy
Citations per year, relative to J. A. Bondy J. A. Bondy (= 1×) peers U. S. R. Murty

Countries citing papers authored by J. A. Bondy

Since Specialization
Citations

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

Fields of papers citing papers by J. A. Bondy

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of J. A. Bondy

This figure shows the co-authorship network connecting the top 25 collaborators of J. A. Bondy. A scholar is included among the top collaborators of J. A. Bondy 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 J. A. Bondy. J. A. Bondy 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.
Bondy, J. A.. (2008). Christian Journaling and Christian Education. 13. 167–184. 2 indexed citations
2.
Bondy, J. A., et al.. (2007). Graph theory in Paris : proceedings of a conference in memory of Claude Berge. Birkhäuser-Verlag eBooks. 10 indexed citations
3.
Bondy, J. A., Péter L. Erdős, & Siemion Fajtlowicz. (1999). Graphs of diameter two with no 4-circuits. Discrete Mathematics. 200(1-3). 21–25. 14 indexed citations
4.
Bondy, J. A. & Bill Jackson. (1998). Vertices of Small Degree in Uniquely Hamiltonian Graphs. Journal of Combinatorial Theory Series B. 74(2). 265–275. 14 indexed citations
5.
Bondy, J. A. & Zs. Tuza. (1997). A weighted generalization of Turán's theorem. Journal of Graph Theory. 25(4). 267–275. 6 indexed citations
6.
Bondy, J. A.. (1997). Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture. Discrete Mathematics. 165-166. 71–80. 19 indexed citations
7.
Bondy, J. A.. (1996). Basic graph theory: paths and circuits. MIT Press eBooks. 3–110. 99 indexed citations
8.
Bondy, J. A.. (1989). Trigraphs. Discrete Mathematics. 75(1-3). 69–79. 8 indexed citations
9.
Bondy, J. A. & Mekkia Kouider. (1987). Hamilton cycles in regular 2-connected graphs. Journal of Combinatorial Theory Series A. 44(3). 177–186. 4 indexed citations
10.
Bondy, J. A. & Stephen C. Locke. (1981). Relative lengths of paths and cycles in 3-connected graphs. Discrete Mathematics. 33(2). 111–122. 21 indexed citations
11.
Bondy, J. A. & L. Lovász. (1981). Cycles through specified vertices of a graph. COMBINATORICA. 1(2). 117–140. 24 indexed citations
12.
Bondy, J. A. & A. W. Ingleton. (1976). Pancyclic graphs II. Journal of Combinatorial Theory Series B. 20(1). 41–46. 132 indexed citations
13.
Bondy, J. A. & Vašek Chvátal. (1976). A method in graph theory. Discrete Mathematics. 15(2). 111–135. 254 indexed citations
14.
Bondy, J. A. & Miklós Simonovits. (1974). Cycles of even length in graphs. Journal of Combinatorial Theory Series B. 16(2). 97–105. 238 indexed citations
15.
Bondy, J. A. & P. Erdös. (1973). Ramsey numbers for cycles in graphs. Journal of Combinatorial Theory Series B. 14(1). 46–54. 85 indexed citations
16.
Bondy, J. A.. (1972). Induced subsets. Journal of Combinatorial Theory Series B. 12(2). 201–202. 24 indexed citations
17.
Bondy, J. A.. (1971). Pancyclic graphs I. Journal of Combinatorial Theory Series B. 11(1). 80–84. 218 indexed citations
18.
Bondy, J. A.. (1971). Large cycles in graphs. Discrete Mathematics. 1(2). 121–132. 68 indexed citations
19.
Bondy, J. A.. (1969). On the reconstruction of a graph from its closure function. Journal of Combinatorial Theory. 7(3). 221–229. 1 indexed citations
20.
Bondy, J. A.. (1969). Bounds for the chromatic number of a graph. Journal of Combinatorial Theory. 7(1). 96–98. 12 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