John Adrian Bondy

John Adrian Bondy's AcademicInfluence.com Rankings

John Adrian Bondy

Mathematics

#1163

World Rank

#1955

Historical Rank

Measure Theory

#1468

World Rank

#1837

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is John Adrian Bondy Influential?

(Suggest an Edit or Addition)

According to Wikipedia, John Adrian Bondy is a retired English mathematician, known for his work in combinatorics and graph theory. Career Bondy received his Ph.D. in graph theory from the University of Oxford in 1969. His advisor was Dominic Welsh. Between 1969 and 1994, Bondy was Professor of Graph Theory at the University of Waterloo in Canada, and then, until his retirement, at Université Lyon 1 in France. From 1976, he was managing editor, and, between 1979 and 2004, co-editor-in-chief of Journal of Combinatorial Theory, Series B. Throughout his career, Bondy has authored over 100 publications with 51 co-authors, including the widely influential textbook Graph Theory with Applications , and supervised 12 Ph.D. students. His Erdős number is 1.

(See a Problem?)

John Adrian Bondy's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Graph Theory with Applications (1978) (5246)
Graph Theory (2008) (2247)
A method in graph theory (1976) (414)
Cycles of even length in graphs (1974) (381)
Graph reconstruction - a survey (1977) (257)
Pancyclic graphs II (1971) (206)
Basic graph theory: paths and circuits (1996) (184)
A note on the star chromatic number (1990) (169)
Ramsey Numbers for Cycles in Graphs (1973) (163)
Graph theory and related topics (1979) (138)
Surveys in Combinatorics, 1991: “A Graph Reconstructor's Manual” (1991) (126)
Variations on the Hamiltonian Theme (1972) (113)
Large cycles in graphs (1971) (111)
Diconnected Orientations and a Conjecture of Las Vergnas (1976) (97)
Progress in Graph Theory (1984) (87)
Largest bipartite subgraphs in triangle-free graphs with maximum degree three (1986) (85)
The Erdős–Pósa Property For Long Circuits (2007) (63)
Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture (1997) (59)
Small Cycle Double Covers of Graphs (1990) (49)
Optimal Paths and Cycles in Weighted Graphs (1988) (48)
On Ulam’s conjecture for separable graphs (1969) (46)
SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS (1971) (45)
A short proof of Meyniel's theorem (1977) (45)
Beautiful conjectures in graph theory (2014) (44)
Cycles through specified vertices of a graph (1981) (43)
Density Conditions For Triangles In Multipartite Graphs (2006) (42)
Perfect path double covers of graphs (1990) (39)
Cycles in weighted graphs (1991) (37)
Lengths of cycles in halin graphs (1985) (34)
Cycles in a graph whose lengths differ by one or two (1998) (33)
Heavy cycles in weighted graphs (2002) (33)
Relative lengths of paths and cycles in 3-connected graphs (1981) (30)
On Kelly's congruence theorem for trees (1969) (29)
Brambles, Prisms and Grids (2006) (29)
Transversal matroids, base-orderable matroids, and graphs (1972) (27)
A remark on two sufficient conditions for hamilton cycles (1978) (26)
Longest Cycles in 3-Connected 3-Regular Graphs (1980) (25)
Vertices of Small Degree in Uniquely Hamiltonian Graphs (1998) (23)
A De Bruijn-Erdős Theorem for Chordal Graphs (2012) (23)
A sufficient condition for dominating cycles (1987) (23)
Lower Bounds For Induced Forests in Cubic Graphs (1987) (23)
A weighted generalization of Turán's theorem (1997) (21)
Self‐clique graphs and matrix permutations (2003) (21)
Reconstructing infinite graphs (1974) (19)
Bounds for the chromatic number of a graph (1969) (19)
Presentations of Transversal Matroids (1972) (18)
Long Paths Between Specified Vertices of a Block (1985) (18)
Lines in hypergraphs (2011) (18)
Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree (1980) (17)
A short proof of the Chen-Manalastas theorem (1995) (15)
A note on the monomer dimer problem (1966) (15)
Hamilton cycles in regular 2-connected graphs (1987) (15)
Graphs of diameter two with no 4-circuits (1999) (14)
Number of lines in hypergraphs (2013) (14)
Short proofs of classical theorems (2003) (13)
Graphs and Subgraphs (1976) (13)
Trigraphs (1989) (12)
Independent Sets and Cliques (1976) (11)
Edge-disjoint Hamilton cycles in 4-regular planar graphs (1981) (10)
Parity theorems for paths and cycles in graphs (1986) (9)
Graph theory in Paris : proceedings of a conference in memory of Claude Berge (2007) (9)
Kotzig's Conjecture on Generalized Friendship Graphs - a Survey (1985) (9)
A Collection of Open Problems (1989) (9)
Balanced colourings and the four colour conjecture (1972) (9)
Graph theory and related topics: Proceedings of the conference held in honour of Professor W.T. Tutte on the occasion of his sixtieth birthday, University of Waterloo, July 5-9, 1977 (1979) (8)
A sufficient condition for self-clique graphs (2001) (8)
Progress Report: EIDMA Workshop on Hamiltonicity of 2-tough graphs (1996) (8)
Tree-width of graphs without a 3×3 grid minor (2009) (8)
Analysis of murine HOXA-2 activity in Drosophila melanogaster. (1999) (7)
Large dense neighbourhoods and turán's theorem (1983) (7)
The "Graph Theory" of the Greek Alphabet (1972) (7)
OSA PROPERTY FOR LONG CIRCUITS (2007) (7)
Induced Decompositions of Graphs (2013) (7)
Triangle-free subgraphs of powers of cycles (1992) (6)
Constructing Optimal k-Radius Sequences (2016) (5)
Colourings of Maps (2008) (5)
Counterexamples to theorems of Menger type for the diameter (1983) (5)
The meeting of a mathematical challenge. (1978) (5)
Switching reconstruction of digraphs (2011) (4)
Reflections on the legitimate deck problem (1978) (3)
A Note on the Diameter of a Graph (1968) (3)
Lexicographic Products and a Conjecture of Hahn and Jackson (2009) (2)
Extremal graphs with prescribed covering number (1978) (2)
Erratum: Constructing Optimal k-Radius Sequences (2017) (2)
Vašek Chvátal: A Very Short Introduction (2007) (2)
The Cycle Space and Bond Space (1976) (1)
P ∨ VERTEX-DISTINGUISHING EDGE CHROMATIC NUMBER OF GRAPH (2013) (1)
On the reconstruction of a graph from its closure function (1969) (1)
The Four-Colour Problem (2008) (0)
Stable Sets and Cliques (2008) (0)
Tree-Search Algorithms (2008) (0)
Flows in Networks (2008) (0)
The Meeting of a Mathematical Challenge: The Four-Color Problem . Assaults and Conquest. Thomas L. Saaty and Paul C. Kainen. McGraw-Hill, New York, 1977. x, 218 pp., illus. $22. Advanced Book Program. (1978) (0)
Tree-widthofgraphswithouta3 3gridminor (2009) (0)
ON THE VERTEX-DISTINGUISHING EDGE CHROMATIC (2015) (0)
Generation of Digit Reversed Address Sequences for Fast Fourier Transforms (1991) (0)
On the lower limit of the linear recession constant (2021) (0)
Erratum (1983) (0)
The Meeting of a Mathematical Challenge. (Book Reviews: The Four-Color Problem. Assaults and Conquest) (1978) (0)
Preface (2006) (0)
Complexity of Algorithms (2008) (0)
Coverings and Packings in Directed Graphs (2008) (0)
Euler Tours and Hamilton Cycles (1976) (0)
Integer Flows and Coverings (2008) (0)

This paper list is powered by the following services:

Other Resources About John Adrian Bondy

en.wikipedia.org

What Schools Are Affiliated With John Adrian Bondy?

John Adrian Bondy is affiliated with the following schools: