Ronald J. Gould

According to our database1, Ronald J. Gould authored at least 121 papers between 1980 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.



In proceedings 
PhD thesis 


Online presence:



On Degree Sum Conditions and Vertex-Disjoint Chorded Cycles.
Graphs Comb., 2020

On spanning trees with few branch vertices.
Discret. Math., 2020

Spanning bipartite graphs with high degree sum in graphs.
Discret. Math., 2020

On independent triples and vertex-disjoint chorded cycles in graphs.
Australas. J Comb., 2020

Gaps in the saturation spectrum of trees.
Discuss. Math. Graph Theory, 2019

Degree sum and vertex dominating paths.
J. Graph Theory, 2018

On (K<sub>t</sub>-e)-Saturated Graphs.
Graphs Comb., 2018

Extending Vertex and Edge Pancyclic Graphs.
Graphs Comb., 2018

On vertex-disjoint cycles and degree sum conditions.
Discret. Math., 2018

Cycles with a chord in dense graphs.
Discret. Math., 2018

Minimum Degree and Dominating Paths.
J. Graph Theory, 2017

Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle.
Graphs Comb., 2017

Saturation spectrum of paths and stars.
Discuss. Math. Graph Theory, 2017

Forbidden subgraphs for chorded pancyclicity.
Discret. Math., 2017

A note on extending Bondy's meta-conjecture.
Australas. J Comb., 2017

Chorded Cycles.
Graphs Comb., 2016

Disjoint Chorded Cycles of the Same Length.
SIAM J. Discret. Math., 2015

On independent doubly chorded cycles.
Discret. Math., 2015

Multiply Chorded Cycles.
SIAM J. Discret. Math., 2014

Recent Advances on the Hamiltonian Problem: Survey III.
Graphs Comb., 2014

3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected.
Graphs Comb., 2014

Weak saturation numbers for multiple copies.
Discret. Math., 2014

Saturation Numbers for Nearly Complete Graphs.
Graphs Comb., 2013

Minimum degree and disjoint cycles in generalized claw-free graphs.
Eur. J. Comb., 2013

Weak saturation numbers for sparse graphs.
Discuss. Math. Graph Theory, 2013

On the non-(<i>p-1</i>)-partite <i>K<sub>p</sub></i>-free graphs.
Discuss. Math. Graph Theory, 2013

Pancyclicity of 4-connected {claw, generalized bull}-free graphs.
Discret. Math., 2013

Precise location of vertices on Hamiltonian cycles.
Discret. Math., 2013

A note on powers of Hamilton cycles in generalized claw-free graphs.
Discret. Math., 2013

Property <i>P</i><i>d</i>, <i>m</i> and efficient design of reliable networks.
Networks, 2012

New Ore-Type Conditions for <i>H</i>-Linked Graphs.
J. Graph Theory, 2012

Distributing vertices on Hamiltonian cycles.
J. Graph Theory, 2012

The edge spectrum of the saturation number for small paths.
Discret. Math., 2012

Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs.
Discret. Math., 2012

Minimum Degree and Disjoint Cycles in Claw-Free Graphs.
Comb. Probab. Comput., 2012

Chvátal-Erdös type theorems.
Discuss. Math. Graph Theory, 2010

An iterative approach to graph irregularity strength.
Discret. Appl. Math., 2010

Ramsey numbers in rainbow triangle free colorings.
Australas. J Comb., 2010

Critical graphs for subpancyclicity of 3-connected claw-free graphs.
J. Graph Theory, 2009

Minimum degree and pan-k-linked graphs.
Discret. Math., 2009

A look at cycles containing specified elements of a graph.
Discret. Math., 2009

Disjoint hamiltonian cycles in bipartite graphs.
Discret. Math., 2009

Pancyclic graphs and linear forests.
Discret. Math., 2009

tK<sub>p</sub>-saturated graphs of minimum size.
Discret. Math., 2009

Saturation Numbers for Trees.
Electron. J. Comb., 2009

On <i>H</i>-immersions.
J. Graph Theory, 2008

Graphic sequences with a realization containing a complete multipartite subgraph.
Discret. Math., 2008

Saturation Numbers of Books.
Electron. J. Comb., 2008

Subdivision Extendibility.
Graphs Comb., 2007

The structure and existence of 2-factors in iterated line graphs.
Discuss. Math. Graph Theory, 2007

Chvátal Erdós condition and 2-factors with a specyfied number of components.
Discuss. Math. Graph Theory, 2007

Minimum degree and the minimum size of K<sub>2</sub><sup>2</sup>-saturated graphs.
Discret. Math., 2007

Graphic Sequences with a Realization Containing a Friendship Graph.
Ars Comb., 2007

On Minimum Degree Implying That a Graph is H-Linked.
SIAM J. Discret. Math., 2006

Cycle Extendability of Hamiltonian Interval Graphs.
SIAM J. Discret. Math., 2006

On <i>H</i>-Linked Graphs.
Graphs Comb., 2006

Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size.
Electron. J. Comb., 2006

Distance between two k-sets and Path-Systems Extendibility.
Ars Comb., 2006

Graph minors and linkages.
J. Graph Theory, 2005

Minimal Degree and (<i>k, m</i>)-Pancyclic Ordered Graphs.
Graphs Comb., 2005

Potential forbidden triples implying hamiltonicity: for sufficiently large graphs.
Discuss. Math. Graph Theory, 2005

A note on 2-factors with two components.
Discret. Math., 2005

A Note on Neighborhood Unions and Independent Cycles.
Ars Comb., 2005

Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs.
J. Graph Theory, 2004

Generalizing Pancyclic and <i>k</i>-Ordered Graphs.
Graphs Comb., 2004

Forbidden triples implying Hamiltonicity: for all graphs.
Discuss. Math. Graph Theory, 2004

Linear forests and ordered cycles.
Discuss. Math. Graph Theory, 2004

Toughness, degrees and 2-factors.
Discret. Math., 2004

New Conditions for k-ordered Hamiltonian Graphs.
Ars Comb., 2004

Degree conditions for <i>k</i>-ordered hamiltonian graphs.
J. Graph Theory, 2003

Extremal graphs for intersecting cliques.
J. Comb. Theory, Ser. B, 2003

Advances on the Hamiltonian Problem - A Survey.
Graphs Comb., 2003

On k-Ordered Bipartite Graphs.
Electron. J. Comb., 2003

Graph Connectivity After Path Removal.
Comb., 2003

Connectivity and Traversability.
Proceedings of the Handbook of Graph Theory., 2003

On graph irregularity strength.
J. Graph Theory, 2002

A Note on Cycle Lengths in Graphs.
Graphs Comb., 2002

Pancyclicity in claw-free graphs.
Discret. Math., 2002

Characterizing forbidden clawless triples implying hamiltonian graphs.
Discret. Math., 2002

Partitioning Vertices of a Tournament into Independent Cycles.
J. Comb. Theory, Ser. B, 2001

Two-factors with few cycles in claw-free graphs.
Discret. Math., 2001

Results on degrees and the structure of 2-factors.
Discret. Math., 2001

Edge disjoint monochromatic triangles in 2-colored graphs.
Discret. Math., 2001

Path Spectra and Forbidden Families.
Ars Comb., 2001

On <i>k</i>-ordered graphs.
J. Graph Theory, 2000

Cycles in 2-Factors of Balanced Bipartite Graphs.
Graphs Comb., 2000

2-factors in claw-free graphs.
Discuss. Math. Graph Theory, 2000

Forbidden triples and traceability: a characterization.
Discret. Math., 1999

On 2-factors containing 1-factors in bipartite graphs.
Discret. Math., 1999

Intersections of Longest Cycles in k-Connected Graphs.
J. Comb. Theory, Ser. B, 1998

Traceability in graphs with forbidden triples of subgraphs.
Discret. Math., 1998

Degree conditions for 2-factors.
J. Graph Theory, 1997

Characterizing forbidden pairs for hamiltonian properties.
Discret. Math., 1997

On <i>p</i>-intersection representations.
J. Graph Theory, 1996

Graph spectra.
Discret. Math., 1996

Generalized degree conditions for graphs with bounded independence number.
J. Graph Theory, 1995

Extremal Graphs for Intersecting Triangles.
J. Comb. Theory, Ser. B, 1995

Hamiltonicity in balanced<i>k</i>-partite graphs.
Graphs Comb., 1995

Spanning caterpllars with bounded diameter.
Discuss. Math. Graph Theory, 1995

Degree conditions and cycle extendability.
Discret. Math., 1995

On hamiltonian-connected graphs.
J. Graph Theory, 1994

Neighborhood unions and the cycle cover number of a graph.
J. Graph Theory, 1994

On isomorphic subgraphs.
Discret. Math., 1993

On independent generalized degrees and independence numbers in K(1, m)-free graphs.
Discret. Math., 1992

Neighborhood unions and a generalization of Dirac's theorem.
Discret. Math., 1992

Generalized Degrees and Menger Path Systems.
Discret. Appl. Math., 1992

Updating the hamiltonian problem - A survey.
J. Graph Theory, 1991

Neighborhood conditions and edge-disjoint perfect matchings.
Discret. Math., 1991

Lower bounds for lower Ramsey numbers.
J. Graph Theory, 1990

Neighborhood unions and hamiltonian properties in graphs.
J. Comb. Theory, Ser. B, 1989

On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs.
Eur. J. Comb., 1989

Graph theory.
Benjamin/Cummings, ISBN: 978-0-8053-6030-1, 1988

Extremal problems involving neighborhood unions.
J. Graph Theory, 1987

Goodness of trees for generalized books.
Graphs Comb., 1987

Cayley digraphs and (1, j, n)-sequencings of the alternating groups A<sub>n</sub>.
Discret. Math., 1987

Forbidden subgraphs and hamiitonian properties in the square of a connected graph.
J. Graph Theory, 1984

On the Ramsey number of trees versus graphs with large clique number.
J. Graph Theory, 1983

Bounds for the ramsey number of a disconnected graph versus any graph.
J. Graph Theory, 1982

Forbidden subgraphs and Hamiltonian properties of graphs.
Discret. Math., 1982

On line graphs and the hamiltonian index.
Discret. Math., 1981

On ramsey numbers of forests versus nearly complete graphs.
J. Graph Theory, 1980