Ronald J. Gould

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Gaps in the saturation spectrum of trees.
Discussiones Mathematicae Graph Theory, 2019

2018
Degree sum and vertex dominating paths.
Journal of Graph Theory, 2018

On (Kt-e)-Saturated Graphs.
Graphs and Combinatorics, 2018

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

On vertex-disjoint cycles and degree sum conditions.
Discrete Mathematics, 2018

Cycles with a chord in dense graphs.
Discrete Mathematics, 2018

2017
Minimum Degree and Dominating Paths.
Journal of Graph Theory, 2017

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

Saturation spectrum of paths and stars.
Discussiones Mathematicae Graph Theory, 2017

Forbidden subgraphs for chorded pancyclicity.
Discrete Mathematics, 2017

A note on extending Bondy's meta-conjecture.
Australasian J. Combinatorics, 2017

2016
Chorded Cycles.
Graphs and Combinatorics, 2016

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

On independent doubly chorded cycles.
Discrete Mathematics, 2015

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

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

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

Weak saturation numbers for multiple copies.
Discrete Mathematics, 2014

2013
Saturation Numbers for Nearly Complete Graphs.
Graphs and Combinatorics, 2013

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

Weak saturation numbers for sparse graphs.
Discussiones Mathematicae Graph Theory, 2013

On the non-(p-1)-partite Kp-free graphs.
Discussiones Mathematicae Graph Theory, 2013

Pancyclicity of 4-connected {claw, generalized bull}-free graphs.
Discrete Mathematics, 2013

Precise location of vertices on Hamiltonian cycles.
Discrete Mathematics, 2013

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

2012
Property Pd, m and efficient design of reliable networks.
Networks, 2012

New Ore-Type Conditions for H-Linked Graphs.
Journal of Graph Theory, 2012

Distributing vertices on Hamiltonian cycles.
Journal of Graph Theory, 2012

The edge spectrum of the saturation number for small paths.
Discrete Mathematics, 2012

Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs.
Discrete Mathematics, 2012

Minimum Degree and Disjoint Cycles in Claw-Free Graphs.
Combinatorics, Probability & Computing, 2012

2010
Chvátal-Erdös type theorems.
Discussiones Mathematicae Graph Theory, 2010

An iterative approach to graph irregularity strength.
Discrete Applied Mathematics, 2010

Ramsey numbers in rainbow triangle free colorings.
Australasian J. Combinatorics, 2010

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

Minimum degree and pan-k-linked graphs.
Discrete Mathematics, 2009

A look at cycles containing specified elements of a graph.
Discrete Mathematics, 2009

Disjoint hamiltonian cycles in bipartite graphs.
Discrete Mathematics, 2009

Pancyclic graphs and linear forests.
Discrete Mathematics, 2009

tKp-saturated graphs of minimum size.
Discrete Mathematics, 2009

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

2008
On H-immersions.
Journal of Graph Theory, 2008

Graphic sequences with a realization containing a complete multipartite subgraph.
Discrete Mathematics, 2008

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

2007
Subdivision Extendibility.
Graphs and Combinatorics, 2007

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

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

Minimum degree and the minimum size of K22-saturated graphs.
Discrete Mathematics, 2007

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

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

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

On H-Linked Graphs.
Graphs and Combinatorics, 2006

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

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

2005
Graph minors and linkages.
Journal of Graph Theory, 2005

Minimal Degree and (k, m)-Pancyclic Ordered Graphs.
Graphs and Combinatorics, 2005

Potential forbidden triples implying hamiltonicity: for sufficiently large graphs.
Discussiones Mathematicae Graph Theory, 2005

A note on 2-factors with two components.
Discrete Mathematics, 2005

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

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

Generalizing Pancyclic and k-Ordered Graphs.
Graphs and Combinatorics, 2004

Forbidden triples implying Hamiltonicity: for all graphs.
Discussiones Mathematicae Graph Theory, 2004

Linear forests and ordered cycles.
Discussiones Mathematicae Graph Theory, 2004

Toughness, degrees and 2-factors.
Discrete Mathematics, 2004

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

2003
Degree conditions for k-ordered hamiltonian graphs.
Journal of Graph Theory, 2003

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

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

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

Graph Connectivity After Path Removal.
Combinatorica, 2003

2002
On graph irregularity strength.
Journal of Graph Theory, 2002

A Note on Cycle Lengths in Graphs.
Graphs and Combinatorics, 2002

Pancyclicity in claw-free graphs.
Discrete Mathematics, 2002

Characterizing forbidden clawless triples implying hamiltonian graphs.
Discrete Mathematics, 2002

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

Two-factors with few cycles in claw-free graphs.
Discrete Mathematics, 2001

Results on degrees and the structure of 2-factors.
Discrete Mathematics, 2001

Edge disjoint monochromatic triangles in 2-colored graphs.
Discrete Mathematics, 2001

Path Spectra and Forbidden Families.
Ars Comb., 2001

2000
On k-ordered graphs.
Journal of Graph Theory, 2000

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

2-factors in claw-free graphs.
Discussiones Mathematicae Graph Theory, 2000

1999
Forbidden triples and traceability: a characterization.
Discrete Mathematics, 1999

On 2-factors containing 1-factors in bipartite graphs.
Discrete Mathematics, 1999

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

Traceability in graphs with forbidden triples of subgraphs.
Discrete Mathematics, 1998

1997
Degree conditions for 2-factors.
Journal of Graph Theory, 1997

Characterizing forbidden pairs for hamiltonian properties.
Discrete Mathematics, 1997

1996
On p-intersection representations.
Journal of Graph Theory, 1996

Graph spectra.
Discrete Mathematics, 1996

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

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

Hamiltonicity in balancedk-partite graphs.
Graphs and Combinatorics, 1995

Spanning caterpllars with bounded diameter.
Discussiones Mathematicae Graph Theory, 1995

Degree conditions and cycle extendability.
Discrete Mathematics, 1995

1994
On hamiltonian-connected graphs.
Journal of Graph Theory, 1994

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

1993
On isomorphic subgraphs.
Discrete Mathematics, 1993

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

Neighborhood unions and a generalization of Dirac's theorem.
Discrete Mathematics, 1992

Generalized Degrees and Menger Path Systems.
Discrete Applied Mathematics, 1992

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

Neighborhood conditions and edge-disjoint perfect matchings.
Discrete Mathematics, 1991

1990
Lower bounds for lower Ramsey numbers.
Journal of Graph Theory, 1990

1989
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

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

1987
Extremal problems involving neighborhood unions.
Journal of Graph Theory, 1987

Goodness of trees for generalized books.
Graphs and Combinatorics, 1987

Cayley digraphs and (1, j, n)-sequencings of the alternating groups An.
Discrete Mathematics, 1987

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

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

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

Forbidden subgraphs and Hamiltonian properties of graphs.
Discrete Mathematics, 1982

1981
On line graphs and the hamiltonian index.
Discrete Mathematics, 1981

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


  Loading...