Ronald J. Gould

According to our database, Ronald J. Gould authored at least 124 papers between 1980 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of one.

2024

Chorded pancyclicity with distance two degree condition and doubly chorded pancyclicity.

Megan Cream, Ronald J. Gould, Kazuhide Hirohata

Australas. J Comb., February, 2024

2022

Structure in sparse <i>k</i>-critical graphs.

Ronald J. Gould, Victor Larsen, Luke Postle

J. Comb. Theory, Ser. B, 2022

Results and Problems on Chorded Cycles: A Survey.

Ronald J. Gould

Graphs Comb., 2022

2020

On Degree Sum Conditions and Vertex-Disjoint Chorded Cycles.

Bradley Elliott, Ronald J. Gould, Kazuhide Hirohata

Graphs Comb., 2020

On spanning trees with few branch vertices.

Ronald J. Gould, Warren Shull

Discret. Math., 2020

Spanning bipartite graphs with high degree sum in graphs.

Guantao Chen, Shuya Chiba, Ronald J. Gould, Xiaofeng Gu, Akira Saito, Masao Tsugaki, Tomoki Yamashita

Discret. Math., 2020

On independent triples and vertex-disjoint chorded cycles in graphs.

Ronald J. Gould, Kazuhide Hirohata, Ariel Keller Rorabaugh

Australas. J Comb., 2020

2019

Gaps in the saturation spectrum of trees.

Ronald J. Gould, Paul Horn, Michael S. Jacobson, Brent J. Thomas

Discuss. Math. Graph Theory, 2019

2018

Degree sum and vertex dominating paths.

Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Paul Horn, Michael S. Jacobson

J. Graph Theory, 2018

On (K_t-e)-Saturated Graphs.

Jessica Fuller, Ronald J. Gould

Graphs Comb., 2018

Extending Vertex and Edge Pancyclic Graphs.

Megan Cream, Ronald J. Gould, Kazuhide Hirohata

Graphs Comb., 2018

On vertex-disjoint cycles and degree sum conditions.

Ronald J. Gould, Kazuhide Hirohata, Ariel Keller

Discret. Math., 2018

Cycles with a chord in dense graphs.

Guantao Chen, Ronald J. Gould, Xiaofeng Gu, Akira Saito

Discret. Math., 2018

2017

Minimum Degree and Dominating Paths.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Douglas B. West

J. Graph Theory, 2017

Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle.

Ronald J. Gould, Colton Magnant, Pouria Salehi Nowbandegani

Graphs Comb., 2017

Saturation spectrum of paths and stars.

Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Brent J. Thomas

Discuss. Math. Graph Theory, 2017

Forbidden subgraphs for chorded pancyclicity.

Megan Cream, Ronald J. Gould, Victor Larsen

Discret. Math., 2017

A note on extending Bondy's meta-conjecture.

Megan Cream, Ronald J. Gould, Kazuhide Hirohata

Australas. J Comb., 2017

2016

Chorded Cycles.

Megan Cream, Ralph J. Faudree, Ronald J. Gould, Kazuhide Hirohata

Graphs Comb., 2016

2015

Disjoint Chorded Cycles of the Same Length.

Guantao Chen, Ronald J. Gould, Kazuhide Hirohata, Katsuhiro Ota, Songling Shan

SIAM J. Discret. Math., 2015

On independent doubly chorded cycles.

Ronald J. Gould, Kazuhide Hirohata, Paul Horn

Discret. Math., 2015

2014

Multiply Chorded Cycles.

Ronald J. Gould, Paul Horn, Colton Magnant

SIAM J. Discret. Math., 2014

Recent Advances on the Hamiltonian Problem: Survey III.

Ronald J. Gould

Graphs Comb., 2014

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

Qiuju Bian, Ronald J. Gould, Paul Horn, Susan Janiszewski, Steve La Fleur, Paul Wrayno

Graphs Comb., 2014

Weak saturation numbers for multiple copies.

Ralph J. Faudree, Ronald J. Gould

Discret. Math., 2014

2013

Saturation Numbers for Nearly Complete Graphs.

Ralph J. Faudree, Ronald J. Gould

Graphs Comb., 2013

Minimum degree and disjoint cycles in generalized claw-free graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Eur. J. Comb., 2013

Weak saturation numbers for sparse graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Discuss. Math. Graph Theory, 2013

On the non-(<i>p-1</i>)-partite <i>K_p</i>-free graphs.

Kinnari Amin, Jill R. Faudree, Ronald J. Gould, Elzbieta Sidorowicz

Discuss. Math. Graph Theory, 2013

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

Michael Ferrara, Silke Gehrke, Ronald J. Gould, Colton Magnant, Jeffrey S. Powell

Discret. Math., 2013

Precise location of vertices on Hamiltonian cycles.

Ralph J. Faudree, Ronald J. Gould

Discret. Math., 2013

A note on powers of Hamilton cycles in generalized claw-free graphs.

Ralph J. Faudree, Ronald J. Gould

Discret. Math., 2013

2012

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

Ralph J. Faudree, Ronald J. Gould, Jeffrey S. Powell

Networks, 2012

New Ore-Type Conditions for <i>H</i>-Linked Graphs.

Michael Ferrara, Ronald J. Gould, Michael S. Jacobson, Florian Pfender, Jeffrey S. Powell, Thor Whalen

J. Graph Theory, 2012

Distributing vertices on Hamiltonian cycles.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant

J. Graph Theory, 2012

The edge spectrum of the saturation number for small paths.

Ronald J. Gould, Wenliang Tang, Erling Wei, Cun-Quan Zhang

Discret. Math., 2012

Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs.

Guantao Chen, Yoshimi Egawa, Ronald J. Gould, Akira Saito

Discret. Math., 2012

Minimum Degree and Disjoint Cycles in Claw-Free Graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Comb. Probab. Comput., 2012

2010

Chvátal-Erdös type theorems.

Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant

Discuss. Math. Graph Theory, 2010

An iterative approach to graph irregularity strength.

Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender

Discret. Appl. Math., 2010

Ramsey numbers in rainbow triangle free colorings.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant

Australas. J Comb., 2010

2009

Critical graphs for subpancyclicity of 3-connected claw-free graphs.

Ronald J. Gould, Tomasz Luczak, Florian Pfender

J. Graph Theory, 2009

Minimum degree and pan-k-linked graphs.

Ronald J. Gould, Jeffrey S. Powell, Brian C. Wagner, Thor Whalen

Discret. Math., 2009

A look at cycles containing specified elements of a graph.

Ronald J. Gould

Discret. Math., 2009

Disjoint hamiltonian cycles in bipartite graphs.

Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen

Discret. Math., 2009

Pancyclic graphs and linear forests.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Discret. Math., 2009

tK_p-saturated graphs of minimum size.

Ralph J. Faudree, Michael Ferrara, Ronald J. Gould, Michael S. Jacobson

Discret. Math., 2009

Saturation Numbers for Trees.

Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Electron. J. Comb., 2009

2008

On <i>H</i>-immersions.

Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen

J. Graph Theory, 2008

Graphic sequences with a realization containing a complete multipartite subgraph.

Guantao Chen, Michael Ferrara, Ronald J. Gould, John R. Schmitt

Discret. Math., 2008

Saturation Numbers of Books.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould

Electron. J. Comb., 2008

2007

Subdivision Extendibility.

Ronald J. Gould, Thor Whalen

Graphs Comb., 2007

The structure and existence of 2-factors in iterated line graphs.

Michael J. Ferrara, Ronald J. Gould, Stephen G. Hartke

Discuss. Math. Graph Theory, 2007

Chvátal Erdós condition and 2-factors with a specyfied number of components.

Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer

Discuss. Math. Graph Theory, 2007

Minimum degree and the minimum size of K₂²-saturated graphs.

Ronald J. Gould, John R. Schmitt

Discret. Math., 2007

Graphic Sequences with a Realization Containing a Friendship Graph.

Michael Ferrara, Ronald J. Gould, John R. Schmitt

Ars Comb., 2007

2006

On Minimum Degree Implying That a Graph is H-Linked.

Ronald J. Gould, Alexandr V. Kostochka, Gexin Yu

SIAM J. Discret. Math., 2006

Cycle Extendability of Hamiltonian Interval Graphs.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

SIAM J. Discret. Math., 2006

On <i>H</i>-Linked Graphs.

Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen

Graphs Comb., 2006

Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size.

Ronald J. Gould, Tomasz Luczak, John R. Schmitt

Electron. J. Comb., 2006

Distance between two k-sets and Path-Systems Extendibility.

Ronald J. Gould, Thor Whalen

Ars Comb., 2006

2005

Graph minors and linkages.

Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei

J. Graph Theory, 2005

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

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Graphs Comb., 2005

Potential forbidden triples implying hamiltonicity: for sufficiently large graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Discuss. Math. Graph Theory, 2005

A note on 2-factors with two components.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito

Discret. Math., 2005

A Note on Neighborhood Unions and Independent Cycles.

Jill R. Faudree, Ronald J. Gould

Ars Comb., 2005

2004

Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs.

Ronald J. Gould, Tomasz Luczak, Florian Pfender

J. Graph Theory, 2004

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

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Graphs Comb., 2004

Forbidden triples implying Hamiltonicity: for all graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Discuss. Math. Graph Theory, 2004

Linear forests and ordered cycles.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender

Discuss. Math. Graph Theory, 2004

Toughness, degrees and 2-factors.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito

Discret. Math., 2004

New Conditions for k-ordered Hamiltonian Graphs.

Guantao Chen, Ronald J. Gould, Florian Pfender

Ars Comb., 2004

2003

Degree conditions for <i>k</i>-ordered hamiltonian graphs.

Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito

J. Graph Theory, 2003

Extremal graphs for intersecting cliques.

Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei

J. Comb. Theory, Ser. B, 2003

Advances on the Hamiltonian Problem - A Survey.

Ronald J. Gould

Graphs Comb., 2003

On k-Ordered Bipartite Graphs.

Jill R. Faudree, Ronald J. Gould, Florian Pfender, Allison Wolf

Electron. J. Comb., 2003

Graph Connectivity After Path Removal.

Guantao Chen, Ronald J. Gould, Xingxing Yu

Comb., 2003

Connectivity and Traversability.

Josep Fàbrega, Miguel Angel Fiol, Herbert Fleischner, R. Gary Parker, A Dewdney, Ronald J. Gould, Gregory Z. Gutin

Proceedings of the Handbook of Graph Theory., 2003

2002

On graph irregularity strength.

Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender

J. Graph Theory, 2002

A Note on Cycle Lengths in Graphs.

Ronald J. Gould, Penny E. Haxell, Alex D. Scott

Graphs Comb., 2002

Pancyclicity in claw-free graphs.

Ronald J. Gould, Florian Pfender

Discret. Math., 2002

Characterizing forbidden clawless triples implying hamiltonian graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Discret. Math., 2002

2001

Partitioning Vertices of a Tournament into Independent Cycles.

Guantao Chen, Ronald J. Gould, Hao Li

J. Comb. Theory, Ser. B, 2001

Two-factors with few cycles in claw-free graphs.

Ronald J. Gould, Michael S. Jacobson

Discret. Math., 2001

Results on degrees and the structure of 2-factors.

Ronald J. Gould

Discret. Math., 2001

Edge disjoint monochromatic triangles in 2-colored graphs.

Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel

Discret. Math., 2001

Path Spectra and Forbidden Families.

Allen G. Fuller, Ronald J. Gould

Ars Comb., 2001

2000

On <i>k</i>-ordered graphs.

Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

J. Graph Theory, 2000

Cycles in 2-Factors of Balanced Bipartite Graphs.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Graphs Comb., 2000

2-factors in claw-free graphs.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Akira Saito

Discuss. Math. Graph Theory, 2000

1999

Forbidden triples and traceability: a characterization.

Ronald J. Gould, John M. Harris

Discret. Math., 1999

On 2-factors containing 1-factors in bipartite graphs.

Guantao Chen, Ronald J. Gould, Michael S. Jacobson

Discret. Math., 1999

1998

Intersections of Longest Cycles in k-Connected Graphs.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould

J. Comb. Theory, Ser. B, 1998

Traceability in graphs with forbidden triples of subgraphs.

Ronald J. Gould, John M. Harris

Discret. Math., 1998

1997

Degree conditions for 2-factors.

Stephan Brandt, Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak

J. Graph Theory, 1997

Characterizing forbidden pairs for hamiltonian properties.

Ralph J. Faudree, Ronald J. Gould

Discret. Math., 1997

1996

On <i>p</i>-intersection representations.

Nancy Eaton, Ronald J. Gould, Vojtech Rödl

J. Graph Theory, 1996

Graph spectra.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak

Discret. Math., 1996

1995

Generalized degree conditions for graphs with bounded independence number.

Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak, Terri Lindquester

J. Graph Theory, 1995

Extremal Graphs for Intersecting Triangles.

Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson

J. Comb. Theory, Ser. B, 1995

Hamiltonicity in balanced<i>k</i>-partite graphs.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Graphs Comb., 1995

Spanning caterpllars with bounded diameter.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Discuss. Math. Graph Theory, 1995

Degree conditions and cycle extendability.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Discret. Math., 1995

1994

On hamiltonian-connected graphs.

Ronald J. Gould, Xingxing Yu

J. Graph Theory, 1994

Neighborhood unions and the cycle cover number of a graph.

Guantao Chen, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp

J. Graph Theory, 1994

1993

On isomorphic subgraphs.

Ronald J. Gould, Vojtech Rödl

Discret. Math., 1993

1992

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

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Terri Lindquester

Discret. Math., 1992

Neighborhood unions and a generalization of Dirac's theorem.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Discret. Math., 1992

Generalized Degrees and Menger Path Systems.

Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak

Discret. Appl. Math., 1992

1991

Updating the hamiltonian problem - A survey.

Ronald J. Gould

J. Graph Theory, 1991

Neighborhood conditions and edge-disjoint perfect matchings.

Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak

Discret. Math., 1991

1990

Lower bounds for lower Ramsey numbers.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

J. Graph Theory, 1990

1989

Neighborhood unions and hamiltonian properties in graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp

J. Comb. Theory, Ser. B, 1989

On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs.

Ralph J. Faudree, Michael S. Jacobson, Ronald J. Gould, Linda M. Lesniak

Eur. J. Comb., 1989

1988

Graph theory.

Ronald J. Gould

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

1987

Extremal problems involving neighborhood unions.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp

J. Graph Theory, 1987

Goodness of trees for generalized books.

Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson

Graphs Comb., 1987

Cayley digraphs and (1, j, n)-sequencings of the alternating groups A_n.

Ronald J. Gould, Robert Roth

Discret. Math., 1987

1984

Forbidden subgraphs and hamiitonian properties in the square of a connected graph.

Ronald J. Gould, Michael S. Jacobson

J. Graph Theory, 1984

1983

On the Ramsey number of trees versus graphs with large clique number.

Ronald J. Gould, Michael S. Jacobson

J. Graph Theory, 1983

1982

Bounds for the ramsey number of a disconnected graph versus any graph.

Ronald J. Gould, Michael S. Jacobson

J. Graph Theory, 1982

Forbidden subgraphs and Hamiltonian properties of graphs.

Ronald J. Gould, Michael S. Jacobson

Discret. Math., 1982

1981

On line graphs and the hamiltonian index.

Ronald J. Gould

Discret. Math., 1981

1980

On ramsey numbers of forests versus nearly complete graphs.

Gary Chartrand, Ronald J. Gould, Albert D. Polimeni

J. Graph Theory, 1980