Ronald J. Gould

From MaRDI portal
Revision as of 13:02, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Ronald J. Gould to Ronald J. Gould: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:175503

Available identifiers

zbMath Open gould.ronald-jDBLP55/1736WikidataQ7364972 ScholiaQ7364972MaRDI QIDQ175503

List of research outcomes





PublicationDate of PublicationType
On vertex-disjoint chorded cycles and degree sum conditions2024-08-13Paper
On the saturation spectrum of odd cycles2024-04-29Paper
On fan-saturated graphs2024-03-26Paper
https://portal.mardi4nfdi.de/entity/Q61775842024-01-17Paper
Book review of: J. Bewersdorff, Luck, logic, and white lies. The mathematics of games. 2nd ed.2023-07-12Paper
Results and problems on chorded cycles: a survey2022-11-29Paper
Structure in sparse \(k\)-critical graphs2022-06-10Paper
On degree sum conditions and vertex-disjoint chorded cycles2021-03-17Paper
https://portal.mardi4nfdi.de/entity/Q51336482020-11-10Paper
https://portal.mardi4nfdi.de/entity/Q33007102020-07-29Paper
Spanning bipartite graphs with high degree sum in graphs2019-12-17Paper
On spanning trees with few branch vertices2019-12-12Paper
https://portal.mardi4nfdi.de/entity/Q52440072019-11-19Paper
https://portal.mardi4nfdi.de/entity/Q46226122019-02-13Paper
Extending vertex and edge pancyclic graphs2019-01-11Paper
Degree sum and vertex dominating paths2019-01-03Paper
Gaps in the saturation spectrum of trees2018-12-05Paper
Cycles with a chord in dense graphs2018-06-07Paper
On \((\mathrm{K}_t-e)\)-saturated graphs2018-03-22Paper
https://portal.mardi4nfdi.de/entity/Q45951992017-11-29Paper
On vertex-disjoint cycles and degree sum conditions2017-10-24Paper
Forbidden subgraphs for chorded pancyclicity2017-09-18Paper
Placing specified vertices at precise locations on a Hamiltonian cycle2017-08-10Paper
Saturation spectrum of paths and stars2017-07-17Paper
https://portal.mardi4nfdi.de/entity/Q29660832017-03-06Paper
Minimum Degree and Dominating Paths2017-02-01Paper
Chorded cycles2017-01-13Paper
Ralph Faudree (1938--2015)2016-04-27Paper
https://portal.mardi4nfdi.de/entity/Q27996922016-04-13Paper
https://portal.mardi4nfdi.de/entity/Q34510192015-11-10Paper
On independent doubly chorded cycles2015-06-29Paper
Disjoint Chorded Cycles of the Same Length2015-06-18Paper
3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected2014-09-19Paper
Weak saturation numbers for multiple copies2014-09-04Paper
Weak saturation numbers for sparse graphs2014-07-30Paper
Multiply Chorded Cycles2014-06-19Paper
Independet cycles and chorded cycles in graphs2014-04-07Paper
Recent advances on the Hamiltonian problem: survey III2014-03-24Paper
https://portal.mardi4nfdi.de/entity/Q54037472014-03-19Paper
Precise location of vertices on Hamiltonian cycles2014-01-24Paper
On the non-(p-1)-partite K_{p}-free graphs2013-12-13Paper
A note on powers of Hamilton cycles in generalized claw-free graphs2013-12-06Paper
Property Pd,m and efficient design of reliable networks2013-08-06Paper
Saturation numbers for nearly complete graphs2013-06-26Paper
Minimum degree and disjoint cycles in generalized claw-free graphs2013-03-19Paper
Pancyclicity of 4-connected \{claw, generalized bull\}-free graphs2013-03-01Paper
New Ore-Type Conditions for H-Linked Graphs2012-09-12Paper
https://portal.mardi4nfdi.de/entity/Q29062752012-09-05Paper
Saturation numbers for families of Ramsey-minimal graphs2012-08-28Paper
The edge spectrum of the saturation number for small paths2012-08-10Paper
Richard Schelp (1936-2010)2012-07-04Paper
Minimum Degree and Disjoint Cycles in Claw-Free Graphs2012-05-14Paper
Forbidden pairs for \(k\)-connected Hamiltonian graphs2012-03-16Paper
Distributing vertices on Hamiltonian cycles2012-02-08Paper
https://portal.mardi4nfdi.de/entity/Q30702012011-02-02Paper
Chvátal-Erdös type theorems2010-12-08Paper
An iterative approach to graph irregularity strength2010-10-11Paper
https://portal.mardi4nfdi.de/entity/Q35658772010-06-07Paper
A note on the Song–Zhang theorem for Hamiltonian graphs2010-06-01Paper
Saturation numbers for trees2010-03-26Paper
Critical graphs for subpancyclicity of 3-connected claw-free graphs2009-12-18Paper
A look at cycles containing specified elements of a graph2009-12-15Paper
tK\(_p\)-saturated graphs of minimum size2009-12-15Paper
Disjoint Hamiltonian cycles in bipartite graphs2009-12-09Paper
https://portal.mardi4nfdi.de/entity/Q33963152009-09-18Paper
https://portal.mardi4nfdi.de/entity/Q36362112009-06-30Paper
Minimum degree and pan-\(k\)-linked graphs2009-06-23Paper
Pancyclic graphs and linear forests2009-04-09Paper
Saturation numbers of books2009-04-07Paper
A new sufficient condition for Hamiltonian graphs2009-03-09Paper
DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES2009-02-12Paper
Graphic sequences with a realization containing a complete multipartite subgraph2009-01-28Paper
Chvátal Erdős condition and 2-factors with a specyfied number of components2008-06-18Paper
The structure and existence of 2-factors in iterated line graphs2008-06-18Paper
On H‐immersions2008-03-20Paper
On Minimum Degree Implying That a Graph is H‐Linked2007-11-16Paper
Cycle Extendability of Hamiltonian Interval Graphs2007-09-06Paper
Subdivision extendibility2007-05-10Paper
https://portal.mardi4nfdi.de/entity/Q34286472007-03-29Paper
Minimum degree and the minimum size of \(K_2^t\)-saturated graphs2007-03-15Paper
https://portal.mardi4nfdi.de/entity/Q34247752007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q54925692006-10-16Paper
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs2006-10-16Paper
On \(H\)-linked graphs2006-09-12Paper
Constructive upper bounds for cycle-saturated graphs of minimum size2006-08-30Paper
https://portal.mardi4nfdi.de/entity/Q54773832006-07-03Paper
https://portal.mardi4nfdi.de/entity/Q54755332006-06-26Paper
Constructive upper bounds for cycle-saturated graphs of minimum size2006-04-03Paper
A note on 2-factors with two components2005-10-26Paper
Minimal degree and \((k,m)\)-pancyclic ordered graphs2005-07-28Paper
https://portal.mardi4nfdi.de/entity/Q27160102005-07-20Paper
Graph minors and linkages2005-06-01Paper
LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES2005-05-09Paper
Linear forests and ordered cycles2005-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46603172005-03-21Paper
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs2005-02-16Paper
Generalizing pancyclic and \(k\)-ordered graphs2005-01-20Paper
Toughness, degrees and 2-factors2004-11-22Paper
Forbidden triples implying Hamiltonicity: for all graphs2004-10-27Paper
Graph connectivity after path removal2004-09-07Paper
Extremal graphs for intersecting cliques2004-01-06Paper
Advances on the Hamiltonian problem -- a survey2003-07-08Paper
https://portal.mardi4nfdi.de/entity/Q44057922003-06-23Paper
On \(k\)-ordered bipartite graphs2003-05-07Paper
Degree conditions for k‐ordered hamiltonian graphs2003-04-03Paper
A note on cycle lengths in graphs2003-03-25Paper
On graph irregularity strength2003-03-19Paper
Partitioning vertices of a tournament into independent cycles2002-12-10Paper
Pancyclicity in claw-free graphs2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q45292642002-10-24Paper
https://portal.mardi4nfdi.de/entity/Q27069512002-10-10Paper
Characterizing forbidden clawless triples implying Hamiltonian graphs2002-05-28Paper
Edge disjoint monochromatic triangles in 2-colored graphs2002-04-21Paper
2-factors in claw-free graphs2002-02-17Paper
Two-factors with few cycles in claw-free graphs2002-02-17Paper
Results on degrees and the structure of 2-factors2001-07-08Paper
https://portal.mardi4nfdi.de/entity/Q27183652001-06-19Paper
Onk-ordered graphs2001-03-30Paper
https://portal.mardi4nfdi.de/entity/Q45006112001-01-29Paper
Traceability in graphs with forbidden triples of subgraphs2000-11-02Paper
Cycles in 2-factors of balanced bipartite graphs2000-09-05Paper
https://portal.mardi4nfdi.de/entity/Q49432892000-06-22Paper
Forbidden triples and traceability: A characterization2000-05-04Paper
On 2-factors containing 1-factors in bipartite graphs1999-12-05Paper
https://portal.mardi4nfdi.de/entity/Q42438041999-05-24Paper
https://portal.mardi4nfdi.de/entity/Q38382061999-01-11Paper
https://portal.mardi4nfdi.de/entity/Q38382291999-01-11Paper
Intersections of longest cycles in \(k\)-connected graphs1998-10-19Paper
https://portal.mardi4nfdi.de/entity/Q43932381998-08-10Paper
Degree conditions for 2-factors1998-01-12Paper
Characterizing forbidden pairs for hamiltonian properties1997-12-22Paper
Graph spectra1997-05-19Paper
https://portal.mardi4nfdi.de/entity/Q52840701997-05-19Paper
Onp-intersection representations1996-11-03Paper
Spanning caterpllars with bounded diameter1996-06-18Paper
Degree conditions and cycle extendability1996-06-05Paper
https://portal.mardi4nfdi.de/entity/Q48532801996-05-30Paper
https://portal.mardi4nfdi.de/entity/Q48634581996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48738261996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48738301996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48736721996-04-17Paper
Hamiltonicity in balanced \(k\)-partite graphs1995-11-29Paper
Generalized degree conditions for graphs with bounded independence number1995-09-12Paper
Extremal graphs for intersecting triangles1995-07-04Paper
On hamiltonian‐connected graphs1995-06-11Paper
Neighborhood unions and the cycle cover number of a graph1995-05-31Paper
On isomorphic subgraphs1994-03-13Paper
https://portal.mardi4nfdi.de/entity/Q40299841993-04-01Paper
On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs1993-01-16Paper
Generalized degrees and Menger path systems1993-01-16Paper
Neighborhood unions and a generalization of Dirac's theorem1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40170301993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39925581992-09-17Paper
Neighborhood conditions and edge-disjoint perfect matchings1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39766161992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39813511992-06-26Paper
A generalization of Dirac's theorem for \(K(1,3)\)-free graphs1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39720001992-06-25Paper
Updating the hamiltonian problem—A survey1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q33633841992-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30353321990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34833111990-01-01Paper
Lower bounds for lower Ramsey numbers1990-01-01Paper
On a neighborhood condition implying the existence of disjoint complete graphs1989-01-01Paper
Neighbourhood unions and Hamiltonian properties in graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34752991989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746761988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47352171988-01-01Paper
Cayley digraphs and (1,j,n)-sequencings of the alternating groups \(A_ n\)1987-01-01Paper
Goodness of trees for generalized books1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37896051987-01-01Paper
Extremal problems involving neighborhood unions1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36997271985-01-01Paper
Forbidden subgraphs and hamiitonian properties in the square of a connected graph1984-01-01Paper
Degree sets and graph factorizations1984-01-01Paper
On the Ramsey number of trees versus graphs with large clique number1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37673761983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37673771983-01-01Paper
Forbidden subgraphs and Hamiltonian properties and graphs1982-01-01Paper
Bounds for the ramsey number of a disconnected graph versus any graph1982-01-01Paper
Graphs with prescribed degree sets and girth1981-01-01Paper
On line graphs and the Hamiltonian index1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39181411981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39505781981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39505821981-01-01Paper
Degree sets for homogeneously traceable non-Hamiltonian graphs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38792801980-01-01Paper
On ramsey numbers of forests versus nearly complete graphs1980-01-01Paper
On ramsey numbers of forests versus nearly complete graphs1980-01-01Paper
A note on locally connected and Hamiltonian-connected graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38614351979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39374381979-01-01Paper
A note on graphs whose neighborhoods are n-cycles1974-01-01Paper

Research outcomes over time

This page was built for person: Ronald J. Gould