Ronald Gould | Academic Influence

Ronald Gould 's AcademicInfluence.com Rankings

Ronald Gould

Mathematics

#4671

World Rank

#6614

Historical Rank

#1594

USA Rank

Measure Theory

#3300

World Rank

#3901

Historical Rank

#952

USA Rank

mathematics Degrees

Download Badge

Mathematics

Ronald Gould 's Degrees

PhD Mathematics University of California, Berkeley
Masters Mathematics University of California, Berkeley
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Ronald Gould Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ronald James Gould is an American mathematician specializing in combinatorics and graph theory. He is a Goodrich C. White professor emeritus in the Emory University Department of Mathematics. Education and career After attending SUNY Fredonia for his undergraduate degree, Gould received his Ph.D. in 1979 from Western Michigan University. His thesis was titled Traceability in Graphs, and was completed under the supervision of Gary Chartrand. He spent a short period as a lecturer at San Jose State University in 1978 and 1979, then moved to Emory University in 1979. He was named to the Goodrich C. White professorship in 2001, and retired in 2016.

(See a Problem?)

Ronald Gould '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

Advances on the Hamiltonian Problem – A Survey (2003) (213)
Updating the hamiltonian problem - A survey (1991) (150)
Characterizing forbidden pairs for hamiltonian properties (1997) (140)
Graph theory (1988) (134)
On graph irregularity strength (2002) (132)
Degree conditions for 2-factors (1997) (79)
Recent Advances on the Hamiltonian Problem: Survey III (2014) (79)
Neighborhood unions and hamiltonian properties in graphs (1989) (78)
Extremal Graphs for Intersecting Triangles (1995) (74)
Forbidden subgraphs and Hamiltonian properties of graphs (1982) (58)
Extremal graphs for intersecting cliques (2003) (45)
Degree conditions for k‐ordered hamiltonian graphs (2003) (39)
Ramsey numbers in rainbow triangle free colorings (2010) (38)
Graph Connectivity After Path Removal (2003) (35)
On k-ordered graphs (2000) (34)
A note on cycles in 2-factors of line graphs (1999) (32)
Partitioning Vertices of a Tournament into Independent Cycles (2001) (32)
Forbidden Subgraphs and Pancyclicity. (1995) (31)
Graphs with prescribed degree sets and girth (1981) (29)
Saturation Numbers of Books (2008) (29)
2-factors in Claw-free Graphs (1999) (27)
On the Non-(p−1)-Partite Kp-Free Graphs (2013) (26)
A look at cycles containing specified elements of a graph (2009) (25)
On Minimum Degree Implying That a Graph is H-Linked (2006) (25)
Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size (2006) (23)
On independent generalized degrees and independence numbers in K(1, m)-free graphs (1992) (23)
On H-Linked Graphs (2006) (22)
Extremal problems involving neighborhood unions (1987) (22)
Saturation Numbers for Trees (2009) (22)
tKp-saturated graphs of minimum size (2009) (21)
A Note on Cycle Lengths in Graphs (2002) (20)
Graphic Sequences with a Realization Containing a Friendship Graph (2007) (20)
A note on locally connected and hamiltonian-connected graphs (1979) (19)
Cycle Extendability of Hamiltonian Interval Graphs (2006) (19)
On k-Ordered Bipartite Graphs (2003) (19)
Two-factors with few cycles in claw-free graphs (2001) (18)
Characterizing forbidden clawless triples implying hamiltonian graphs (2002) (18)
Distributing vertices on Hamiltonian cycles (2012) (18)
Onk-ordered graphs (2000) (17)
Saturation numbers for families of Ramsey-minimal graphs (2011) (17)
Goodness of trees for generalized books (1987) (17)
Edge disjoint monochromatic triangles in 2-colored graphs (2001) (17)
On isomorphic subgraphs (1993) (16)
ON HOMOGENEOUSLY TRACEABLE NONHAMILTONIAN GRAPHS (1979) (16)
Generalizing Pancyclic and k-Ordered Graphs (2004) (16)
Intersections of Longest Cycles in k-Connected Graphs (1998) (16)
Forbidden triples implying Hamiltonicity: for all graphs (2004) (16)
New Conditions for k-ordered Hamiltonian Graphs (2004) (16)
Subdivision Extendibility (2007) (15)
Neighborhood unions and a generalization of Dirac's theorem (1992) (15)
Cycles in 2-Factors of Balanced Bipartite Graphs (2000) (14)
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs (2004) (13)
Pancyclicity of 3‐connected graphs: Pairs of forbidden subgraphs (2004) (13)
An iterative approach to graph irregularity strength (2010) (13)
Graph minors and linkages (2005) (12)
Degree conditions for k-ordered hamiltonian graphs (2003) (12)
Linear forests and ordered cycles (2004) (12)
Traceability in graphs with forbidden triples of subgraphs (1998) (12)
A note on 2-factors with two components (2005) (12)
Toughness, degrees and 2-factors (2004) (12)
Hamiltonicity in balancedk-partite graphs (1995) (11)
Generalized degree conditions for graphs with bounded independence number (1995) (11)
Hamiltonian Connected Graphs Involving Forbidden Subgraphs (2014) (11)
On line graphs and the hamiltonian index (1981) (11)
Multiply Chorded Cycles (2014) (11)
3-Connected {K1,3, P9}-Free Graphs are Hamiltonian-Connected (2014) (11)
On p -intersection representations (1996) (10)
On vertex-disjoint cycles and degree sum conditions (2018) (10)
On independent doubly chorded cycles (2015) (10)
New Ore‐Type Conditions for H‐Linked Graphs (2012) (10)
On H‐immersions (2008) (10)
Precise location of vertices on Hamiltonian cycles (2013) (9)
Minimum Degree and Dominating Paths (2017) (9)
Cayley digraphs and (1, j, n)-sequencings of the alternating groups An (1987) (9)
A note on graphs whose neighborhoods are n-cycles (1974) (9)
DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES (2008) (9)
Pancyclicity in claw-free graphs (2002) (9)
Independent cycles and chorded cycles in graphs (2013) (9)
Pancyclic graphs and linear forests (2009) (9)
On 2-factors containing 1-factors in bipartite graphs (1999) (9)
Forbidden triples and traceability: a characterization (1999) (8)
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs (2005) (8)
Results and Problems on Saturation Numbers for Linear Forests (2015) (8)
Forbidden subgraphs and hamiitonian properties in the square of a connected graph (1984) (8)
Weak Saturation Numbers for Sparse Graphs (2013) (7)
A generalization of Dirac’s theorem for K(1,3)-free graphs (1992) (7)
Pancyclicity of 4-connected {claw, generalized bull}-free graphs (2013) (7)
On the Extremal Number of Edges in 2-Factor Hamiltonian Graphs (2006) (7)
Graphic sequences with a realization containing a complete multipartite subgraph (2008) (7)
Saturation Numbers for Nearly Complete Graphs (2013) (7)
On p-intersection representations (1996) (7)
Minimum degree and the minimum size of K22-saturated graphs (2007) (7)
Cycles with a chord in dense graphs (2018) (7)
Traceability in Graphs (1979) (7)
A note on extending Bondy's meta-conjecture (2017) (7)
A Note on Neighborhood Unions and Independent Cycles (2005) (7)
The edge spectrum of the saturation number for small paths (2012) (7)
Saturation Spectrum of Paths and Stars (2017) (6)
The structure and existence of 2-factors in iterated line graphs (2007) (6)
Mathematics in Games, Sports, and Gambling: - The Games People Play (2009) (6)
Distance between two k-sets and Path-Systems Extendibility (2006) (6)
Weak saturation numbers for multiple copies (2014) (6)
Graph spectra (1996) (6)
Generalized Degrees and Menger Path Systems (1992) (6)
On ramsey numbers of forests versus nearly complete graphs (1980) (6)
Property Pd,m and efficient design of reliable networks (2012) (5)
Chvátal Erdós condition and 2-factors with a specyfied number of components (2007) (5)
Recent Advances on the Hamiltonian Problem: Survey III (2013) (5)
A DIFFERENCE SET METHOD FOR CIRCULANT DECOMPOSITIONS OF COMPLETE PARTITE GRAPHS INTO GREGARIOUS 4-CYCLES (2010) (5)
Minimum Degree and Disjoint Cycles in Claw-Free Graphs (2012) (5)
Results on degrees and the structure of 2-factors (2001) (5)
LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES (2004) (5)
Chorded Cycles (2016) (4)
Degree conditions and cycle extendability (1995) (4)
Minimum degree and pan-k-linked graphs (2009) (4)
On spanning trees with few branch vertices (2020) (4)
Developments on Saturated Graphs (2019) (4)
On the Ramsey number of trees versus graphs with large clique number (1983) (4)
On (Kt-e)-Saturated Graphs (2018) (4)
Mathletics—How Gamblers, Managers, and Sports Enthusiasts Use Mathematics in Baseball, Basketball, and Football by Wayne L. Winston (2011) (3)
Disjoint hamiltonian cycles in bipartite graphs (2009) (3)
A recursive algorithm for Hamiltonian cycles in the (1,j,n)-Cayley graphs of the alternating group (1985) (3)
Neighborhood conditions and edge-disjoint perfect matchings (1991) (3)
Disjoint Chorded Cycles of the Same Length (2015) (3)
Bounds for the ramsey number of a disconnected graph versus any graph (1982) (3)
Degree sets for homogeneously traceable non-Hamiltonian graphs (1981) (3)
A note on the SongZhang theorem for Hamiltonian graphs (2010) (3)
Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle (2017) (3)
Extending Vertex and Edge Pancyclic Graphs (2018) (3)
Advances on the Hamiltonian ProblemA Survey (2005) (3)
On independent triples and vertex-disjoint chorded cycles in graphs (2020) (3)
Degree sets and graph factorizations (1984) (2)
THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS (2007) (2)
THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS (2007) (2)
Minimal Degree and (k, m)-Pancyclic Ordered Graphs (2005) (2)
Forbidden pairs for k-connected Hamiltonian graphs (2012) (2)
Forbidden subgraphs for chorded pancyclicity (2017) (2)
Connectivity and Traversability (2003) (2)
The Edge Spectrum of K − 4 -Saturated Graphs (2011) (2)
Minimum degree and disjoint cycles in generalized claw-free graphs (2013) (2)
Two-Irregular Graphs (1990) (1)
Chvátal-Erdös type theorems (2010) (1)
Neighborhood generalization unions and a of Dirac ’ s theorem (2001) (1)
On Degree Sum Conditions and Vertex-Disjoint Chorded Cycles (2019) (1)
On Vertex-Disjoint Chorded Cycles and Degree Sum Conditions (2020) (1)
Neighborhood Unions and Independent Cycles (2003) (1)
Chorded k-Pancyclic and Weakly k-Pancyclic Graphs (2022) (1)
On ($$\hbox {K}_t-e$$Kt-e)-Saturated Graphs (2018) (1)
Minimum Degree and Even Cycle Lengths (2016) (1)
Path Spectra and Forbidden Families (2001) (1)
Spanning bipartite graphs with high degree sum in graphs (2020) (1)
On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs (1989) (1)
Lower bounds for lower Ramsey numbers (1990) (1)
Critical graphs for subpancyclicity of 3‐connected claw‐free graphs (2009) (1)
Neighborhood unions and the cycle cover number of a graph (1994) (1)
On H-immersions (2008) (1)
Degree sum and vertex dominating paths (2018) (1)
On hamiltonian-connected graphs (1994) (0)
Critical graphs for subpancyclicity of 3-connected claw-free graphs (2009) (0)
Edge-disjoint Hamiltonian cycles in balanced bipartite graphs March 24 , 2003 (2003) (0)
Edge-disjoint Hamiltonian cycles in balanced bipartite graphs December 17 , 2002 (2002) (0)
Note On isomorphic subgraphs (2001) (0)
USING EDGE EXCHANGES TO PROVE THE ERDŐS-JACOBSON-LEHEL CONJECTURE (2008) (0)
GAPS IN THE SATURATION SPECTRUM OF TREES 1 (2016) (0)
Characterizing forbidden pairs for hamiltonian properties 1 (2003) (0)
Luck, Logic, and White Lies. The Mathematics of Games, Second Edition (2022) (0)
3-Connected {K1,3, P9}-Free Graphs are Hamiltonian-Connected (2013) (0)
Distribution Agreement on Graphs with a given Endomorphism Monoid Dean of the Graduate School Date on Graphs with a given Endomorphism Monoid on Graphs with a given Endomorphism Monoid on Graphs with a given Endomorphism Monoid (0)
Phase space factors in multiparticle processes (1985) (0)
Chorded Cycles (2016) (0)
A Generalization of a Result of Catlin (2005) (0)
Connectivity , Linkage , and Hamilton Path-Systems in Bipartite Graphs (2003) (0)
SPANNING CATERPILLARS WITH BOUNDED DIAMETER (2010) (0)
C O ] 3 0 Se p 20 09 Potentially K m − G-graphical Sequences : A Survey ∗ (2009) (0)
On Spanning Trees with few Branch Vertices , all with degree 3 (2016) (0)
Luck, Logic, and White Lies. The Mathematics of Games, Second Edition (2022) (0)
Gaps in the Saturation Spectrum of Trees (2019) (0)
Saturation Numbers for Nearly Complete Graphs (2012) (0)
A note on powers of Hamilton cycles in generalized claw-free graphs (2013) (0)
Results and Problems on Chorded Cycles: A Survey (2022) (0)
Structure in sparse k-critical graphs (2021) (0)
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs (2012) (0)
Spanning caterpllars with bounded diameter (1995) (0)
AN ITERATIVE APPROACH TO THE IRREGULARITY STRENGTH OF TREES (2008) (0)
Extending Vertex and Edge Pancyclic Graphs (2018) (0)
On Fan Saturated Graphs (2021) (0)
POTENTIALLY Km − G-GRAPHICAL SEQUENCES: A SURVEY (2009) (0)
Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle (2017) (0)
Ore-type degree conditions, Path-Systems and Linkages in Graphs (2003) (0)
A Generalization of a result of Catlin : 2-factors in line graphs (2018) (0)

This paper list is powered by the following services:

Other Resources About Ronald Gould

What Schools Are Affiliated With Ronald Gould ?

Ronald Gould is affiliated with the following schools:

Image Attributions

Image Source for Ronald Gould