default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonald J. Gould
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j123]Megan Cream, Ronald J. Gould, Kazuhide Hirohata:
Chorded pancyclicity with distance two degree condition and doubly chorded pancyclicity. Australas. J Comb. 88: 97-108 (2024)- [j122]Megan Cream, Ronald J. Gould:
Chorded k-pancyclic and weakly k-pancyclic graphs. Discuss. Math. Graph Theory 44(1): 337 (2024) - 2022
- [j121]Ronald J. Gould
:
Results and Problems on Chorded Cycles: A Survey. Graphs Comb. 38(6): 189 (2022) - [j120]Ronald J. Gould, Victor Larsen, Luke Postle:
Structure in sparse k-critical graphs. J. Comb. Theory B 156: 194-222 (2022) - 2020
- [j119]Ronald J. Gould, Kazuhide Hirohata, Ariel Keller Rorabaugh:
On independent triples and vertex-disjoint chorded cycles in graphs. Australas. J Comb. 77: 355-372 (2020) - [j118]Ronald J. Gould, Warren Shull:
On spanning trees with few branch vertices. Discret. Math. 343(1): 111581 (2020) - [j117]Guantao Chen, Shuya Chiba, Ronald J. Gould, Xiaofeng Gu, Akira Saito, Masao Tsugaki, Tomoki Yamashita:
Spanning bipartite graphs with high degree sum in graphs. Discret. Math. 343(2): 111663 (2020) - [j116]Bradley Elliott, Ronald J. Gould, Kazuhide Hirohata:
On Degree Sum Conditions and Vertex-Disjoint Chorded Cycles. Graphs Comb. 36(6): 1927-1945 (2020)
2010 – 2019
- 2019
- [j115]Ronald J. Gould, Paul Horn, Michael S. Jacobson, Brent J. Thomas:
Gaps in the saturation spectrum of trees. Discuss. Math. Graph Theory 39(1): 157-170 (2019) - 2018
- [j114]Ronald J. Gould, Kazuhide Hirohata, Ariel Keller:
On vertex-disjoint cycles and degree sum conditions. Discret. Math. 341(1): 203-212 (2018) - [j113]Guantao Chen, Ronald J. Gould, Xiaofeng Gu, Akira Saito:
Cycles with a chord in dense graphs. Discret. Math. 341(8): 2131-2141 (2018) - [j112]Jessica Fuller, Ronald J. Gould:
On (Kt-e)-Saturated Graphs. Graphs Comb. 34(1): 85-95 (2018) - [j111]Megan Cream, Ronald J. Gould, Kazuhide Hirohata:
Extending Vertex and Edge Pancyclic Graphs. Graphs Comb. 34(6): 1691-1711 (2018) - [j110]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Paul Horn, Michael S. Jacobson:
Degree sum and vertex dominating paths. J. Graph Theory 89(3): 250-265 (2018) - 2017
- [j109]Megan Cream, Ronald J. Gould, Kazuhide Hirohata:
A note on extending Bondy's meta-conjecture. Australas. J Comb. 67: 463-469 (2017) - [j108]Megan Cream, Ronald J. Gould, Victor Larsen:
Forbidden subgraphs for chorded pancyclicity. Discret. Math. 340(12): 2878-2888 (2017) - [j107]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Brent J. Thomas:
Saturation spectrum of paths and stars. Discuss. Math. Graph Theory 37(3): 811-822 (2017) - [j106]Ronald J. Gould, Colton Magnant, Pouria Salehi Nowbandegani:
Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle. Graphs Comb. 33(2): 369-385 (2017) - [j105]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Douglas B. West:
Minimum Degree and Dominating Paths. J. Graph Theory 84(2): 202-213 (2017) - 2016
- [j104]Megan Cream, Ralph J. Faudree, Ronald J. Gould, Kazuhide Hirohata:
Chorded Cycles. Graphs Comb. 32(6): 2295-2313 (2016) - 2015
- [j103]Ronald J. Gould, Kazuhide Hirohata, Paul Horn:
On independent doubly chorded cycles. Discret. Math. 338(11): 2051-2071 (2015) - [j102]Guantao Chen, Ronald J. Gould, Kazuhide Hirohata, Katsuhiro Ota, Songling Shan:
Disjoint Chorded Cycles of the Same Length. SIAM J. Discret. Math. 29(2): 1030-1041 (2015) - 2014
- [j101]Ralph J. Faudree, Ronald J. Gould:
Weak saturation numbers for multiple copies. Discret. Math. 336: 1-6 (2014) - [j100]Ronald J. Gould:
Recent Advances on the Hamiltonian Problem: Survey III. Graphs Comb. 30(1): 1-46 (2014) - [j99]Qiuju Bian, Ronald J. Gould, Paul Horn, Susan Janiszewski, Steve La Fleur, Paul Wrayno:
3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected. Graphs Comb. 30(5): 1099-1122 (2014) - [j98]Ronald J. Gould, Paul Horn, Colton Magnant:
Multiply Chorded Cycles. SIAM J. Discret. Math. 28(1): 160-172 (2014) - 2013
- [j97]Michael Ferrara, Silke Gehrke, Ronald J. Gould, Colton Magnant, Jeffrey S. Powell:
Pancyclicity of 4-connected {claw, generalized bull}-free graphs. Discret. Math. 313(4): 460-467 (2013) - [j96]Ralph J. Faudree, Ronald J. Gould:
A note on powers of Hamilton cycles in generalized claw-free graphs. Discret. Math. 313(19): 1915-1917 (2013) - [j95]Ralph J. Faudree, Ronald J. Gould:
Precise location of vertices on Hamiltonian cycles. Discret. Math. 313(23): 2772-2777 (2013) - [j94]Kinnari Amin, Jill R. Faudree, Ronald J. Gould, Elzbieta Sidorowicz:
On the non-(p-1)-partite Kp-free graphs. Discuss. Math. Graph Theory 33(1): 9-23 (2013) - [j93]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Weak saturation numbers for sparse graphs. Discuss. Math. Graph Theory 33(4): 677-693 (2013) - [j92]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Minimum degree and disjoint cycles in generalized claw-free graphs. Eur. J. Comb. 34(5): 875-883 (2013) - [j91]Ralph J. Faudree, Ronald J. Gould:
Saturation Numbers for Nearly Complete Graphs. Graphs Comb. 29(3): 429-448 (2013) - 2012
- [j90]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Minimum Degree and Disjoint Cycles in Claw-Free Graphs. Comb. Probab. Comput. 21(1-2): 129-139 (2012) - [j89]Guantao Chen, Yoshimi Egawa, Ronald J. Gould, Akira Saito:
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs. Discret. Math. 312(5): 938-942 (2012) - [j88]Ronald J. Gould, Wenliang Tang, Erling Wei, Cun-Quan Zhang:
The edge spectrum of the saturation number for small paths. Discret. Math. 312(17): 2682-2689 (2012) - [j87]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Distributing vertices on Hamiltonian cycles. J. Graph Theory 69(1): 28-45 (2012) - [j86]Michael Ferrara, Ronald J. Gould, Michael S. Jacobson, Florian Pfender, Jeffrey S. Powell, Thor Whalen:
New Ore-Type Conditions for H-Linked Graphs. J. Graph Theory 71(1): 69-77 (2012) - [j85]Ralph J. Faudree, Ronald J. Gould, Jeffrey S. Powell:
Property Pd, m and efficient design of reliable networks. Networks 60(3): 167-178 (2012) - 2010
- [j84]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Ramsey numbers in rainbow triangle free colorings. Australas. J Comb. 46: 269-284 (2010) - [j83]Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender:
An iterative approach to graph irregularity strength. Discret. Appl. Math. 158(11): 1189-1194 (2010) - [j82]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Chvátal-Erdös type theorems. Discuss. Math. Graph Theory 30(2): 245-256 (2010)
2000 – 2009
- 2009
- [j81]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Saturation Numbers for Trees. Electron. J. Comb. 16(1) (2009) - [j80]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Pancyclic graphs and linear forests. Discret. Math. 309(5): 1178-1189 (2009) - [j79]Ronald J. Gould, Jeffrey S. Powell, Brian C. Wagner, Thor Whalen:
Minimum degree and pan-k-linked graphs. Discret. Math. 309(10): 3013-3022 (2009) - [j78]Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen:
Disjoint hamiltonian cycles in bipartite graphs. Discret. Math. 309(12): 3811-3820 (2009) - [j77]Ralph J. Faudree, Michael Ferrara, Ronald J. Gould, Michael S. Jacobson:
tKp-saturated graphs of minimum size. Discret. Math. 309(19): 5870-5876 (2009) - [j76]Ronald J. Gould:
A look at cycles containing specified elements of a graph. Discret. Math. 309(21): 6299-6311 (2009) - [j75]Ronald J. Gould, Tomasz Luczak, Florian Pfender:
Critical graphs for subpancyclicity of 3-connected claw-free graphs. J. Graph Theory 62(3): 263-278 (2009) - 2008
- [j74]Guantao Chen, Ralph J. Faudree, Ronald J. Gould:
Saturation Numbers of Books. Electron. J. Comb. 15(1) (2008) - [j73]Guantao Chen, Michael Ferrara, Ronald J. Gould, John R. Schmitt:
Graphic sequences with a realization containing a complete multipartite subgraph. Discret. Math. 308(23): 5712-5721 (2008) - [j72]Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen:
On H-immersions. J. Graph Theory 57(3): 245-254 (2008) - 2007
- [j71]Michael Ferrara, Ronald J. Gould, John R. Schmitt:
Graphic Sequences with a Realization Containing a Friendship Graph. Ars Comb. 85 (2007) - [j70]Ronald J. Gould, John R. Schmitt:
Minimum degree and the minimum size of K22-saturated graphs. Discret. Math. 307(9-10): 1108-1114 (2007) - [j69]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer:
Chvátal Erdós condition and 2-factors with a specyfied number of components. Discuss. Math. Graph Theory 27(3): 401-407 (2007) - [j68]Michael J. Ferrara, Ronald J. Gould, Stephen G. Hartke:
The structure and existence of 2-factors in iterated line graphs. Discuss. Math. Graph Theory 27(3): 507-526 (2007) - [j67]Ronald J. Gould, Thor Whalen:
Subdivision Extendibility. Graphs Comb. 23(2): 165-182 (2007) - 2006
- [j66]Ronald J. Gould, Thor Whalen:
Distance between two k-sets and Path-Systems Extendibility. Ars Comb. 79 (2006) - [j65]Ronald J. Gould, Tomasz Luczak, John R. Schmitt:
Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size. Electron. J. Comb. 13(1) (2006) - [j64]Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen:
On H-Linked Graphs. Graphs Comb. 22(2): 217-224 (2006) - [j63]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Cycle Extendability of Hamiltonian Interval Graphs. SIAM J. Discret. Math. 20(3): 682-689 (2006) - [j62]Ronald J. Gould, Alexandr V. Kostochka, Gexin Yu:
On Minimum Degree Implying That a Graph is H-Linked. SIAM J. Discret. Math. 20(4): 829-840 (2006) - 2005
- [j61]Jill R. Faudree, Ronald J. Gould:
A Note on Neighborhood Unions and Independent Cycles. Ars Comb. 76 (2005) - [j60]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito:
A note on 2-factors with two components. Discret. Math. 300(1-3): 218-224 (2005) - [j59]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs. Discuss. Math. Graph Theory 25(3): 273-289 (2005) - [j58]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Minimal Degree and (k, m)-Pancyclic Ordered Graphs. Graphs Comb. 21(2): 197-211 (2005) - [j57]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei:
Graph minors and linkages. J. Graph Theory 49(1): 75-91 (2005) - 2004
- [j56]Guantao Chen, Ronald J. Gould, Florian Pfender:
New Conditions for k-ordered Hamiltonian Graphs. Ars Comb. 70 (2004) - [j55]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito:
Toughness, degrees and 2-factors. Discret. Math. 286(3): 245-249 (2004) - [j54]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Forbidden triples implying Hamiltonicity: for all graphs. Discuss. Math. Graph Theory 24(1): 47-54 (2004) - [j53]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender:
Linear forests and ordered cycles. Discuss. Math. Graph Theory 24(3): 359-372 (2004) - [j52]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Generalizing Pancyclic and k-Ordered Graphs. Graphs Comb. 20(3): 291-309 (2004) - [j51]Ronald J. Gould, Tomasz Luczak, Florian Pfender:
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. J. Graph Theory 47(3): 183-202 (2004) - 2003
- [j50]Guantao Chen, Ronald J. Gould, Xingxing Yu:
Graph Connectivity After Path Removal. Comb. 23(2): 185-203 (2003) - [j49]Jill R. Faudree, Ronald J. Gould, Florian Pfender, Allison Wolf:
On k-Ordered Bipartite Graphs. Electron. J. Comb. 10 (2003) - [j48]Ronald J. Gould:
Advances on the Hamiltonian Problem - A Survey. Graphs Comb. 19(1): 7-52 (2003) - [j47]Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei:
Extremal graphs for intersecting cliques. J. Comb. Theory B 89(2): 159-171 (2003) - [j46]Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito:
Degree conditions for k-ordered hamiltonian graphs. J. Graph Theory 42(3): 199-210 (2003) - [p1]Josep Fàbrega, Miguel Angel Fiol, Herbert Fleischner, R. Gary Parker, A Dewdney, Ronald J. Gould, Gregory Z. Gutin:
Connectivity and Traversability. Handbook of Graph Theory 2003: 193-339 - 2002
- [j45]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Characterizing forbidden clawless triples implying hamiltonian graphs. Discret. Math. 249(1-3): 71-81 (2002) - [j44]Ronald J. Gould, Florian Pfender:
Pancyclicity in claw-free graphs. Discret. Math. 256(1-2): 151-160 (2002) - [j43]Ronald J. Gould, Penny E. Haxell, Alex D. Scott:
A Note on Cycle Lengths in Graphs. Graphs Comb. 18(3): 491-498 (2002) - [j42]Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender:
On graph irregularity strength. J. Graph Theory 41(2): 120-137 (2002) - 2001
- [j41]Allen G. Fuller, Ronald J. Gould:
Path Spectra and Forbidden Families. Ars Comb. 58 (2001) - [j40]Ronald J. Gould:
Results on degrees and the structure of 2-factors. Discret. Math. 230(1-3): 99-111 (2001) - [j39]Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel:
Edge disjoint monochromatic triangles in 2-colored graphs. Discret. Math. 231(1-3): 135-141 (2001) - [j38]Ronald J. Gould, Michael S. Jacobson:
Two-factors with few cycles in claw-free graphs. Discret. Math. 231(1-3): 191-197 (2001) - [j37]Guantao Chen, Ronald J. Gould, Hao Li:
Partitioning Vertices of a Tournament into Independent Cycles. J. Comb. Theory B 83(2): 213-220 (2001) - 2000
- [j36]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Akira Saito:
2-factors in claw-free graphs. Discuss. Math. Graph Theory 20(2): 165-172 (2000) - [j35]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Cycles in 2-Factors of Balanced Bipartite Graphs. Graphs Comb. 16(1): 67-80 (2000) - [j34]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
On k-ordered graphs. J. Graph Theory 35(2): 69-82 (2000)
1990 – 1999
- 1999
- [j33]Guantao Chen, Ronald J. Gould, Michael S. Jacobson:
On 2-factors containing 1-factors in bipartite graphs. Discret. Math. 197-198: 185-194 (1999) - [j32]Ronald J. Gould, John M. Harris:
Forbidden triples and traceability: a characterization. Discret. Math. 203(1-3): 101-120 (1999) - 1998
- [j31]Ronald J. Gould, John M. Harris:
Traceability in graphs with forbidden triples of subgraphs. Discret. Math. 189(1-3): 123-132 (1998) - [j30]Guantao Chen, Ralph J. Faudree, Ronald J. Gould:
Intersections of Longest Cycles in k-Connected Graphs. J. Comb. Theory B 72(1): 143-149 (1998) - 1997
- [j29]Ralph J. Faudree, Ronald J. Gould:
Characterizing forbidden pairs for hamiltonian properties. Discret. Math. 173(1-3): 45-60 (1997) - [j28]Stephan Brandt, Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Degree conditions for 2-factors. J. Graph Theory 24(2): 165-173 (1997) - 1996
- [j27]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak:
Graph spectra. Discret. Math. 150(1-3): 103-113 (1996) - [j26]Nancy Eaton, Ronald J. Gould, Vojtech Rödl:
On p-intersection representations. J. Graph Theory 21(4): 377-392 (1996) - 1995
- [j25]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Degree conditions and cycle extendability. Discret. Math. 141(1-3): 109-122 (1995) - [j24]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Spanning caterpllars with bounded diameter. Discuss. Math. Graph Theory 15(2): 111-118 (1995) - [j23]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Hamiltonicity in balancedk-partite graphs. Graphs Comb. 11(3): 221-231 (1995) - [j22]Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson:
Extremal Graphs for Intersecting Triangles. J. Comb. Theory B 64(1): 89-100 (1995) - [j21]Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak, Terri Lindquester:
Generalized degree conditions for graphs with bounded independence number. J. Graph Theory 19(3): 397-409 (1995) - 1994
- [j20]Guantao Chen, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Neighborhood unions and the cycle cover number of a graph. J. Graph Theory 18(7): 663-672 (1994) - [j19]Ronald J. Gould, Xingxing Yu:
On hamiltonian-connected graphs. J. Graph Theory 18(8): 841-860 (1994) - 1993
- [j18]Ronald J. Gould, Vojtech Rödl:
On isomorphic subgraphs. Discret. Math. 118(1-3): 259-262 (1993) - 1992
- [j17]Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Generalized Degrees and Menger Path Systems. Discret. Appl. Math. 37/38: 179-191 (1992) - [j16]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Terri Lindquester:
On independent generalized degrees and independence numbers in K(1, m)-free graphs. Discret. Math. 103(1): 17-24 (1992) - [j15]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Neighborhood unions and a generalization of Dirac's theorem. Discret. Math. 105(1-3): 61-71 (1992) - 1991
- [j14]Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Neighborhood conditions and edge-disjoint perfect matchings. Discret. Math. 91(1): 33-43 (1991) - [j13]Ronald J. Gould:
Updating the hamiltonian problem - A survey. J. Graph Theory 15(2): 121-157 (1991) - 1990
- [j12]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Lower bounds for lower Ramsey numbers. J. Graph Theory 14(6): 723-730 (1990)
1980 – 1989
- 1989
- [j11]Ralph J. Faudree, Michael S. Jacobson, Ronald J. Gould, Linda M. Lesniak:
On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs. Eur. J. Comb. 10(5): 427-433 (1989) - [j10]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Neighborhood unions and hamiltonian properties in graphs. J. Comb. Theory B 47(1): 1-9 (1989) - 1988
- [b1]Ronald J. Gould:
Graph theory. Benjamin/Cummings 1988, ISBN 978-0-8053-6030-1, pp. I-VIII, 1-332 - 1987
- [j9]Ronald J. Gould, Robert Roth:
Cayley digraphs and (1, j, n)-sequencings of the alternating groups An. Discret. Math. 66(1-2): 91-102 (1987) - [j8]Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson:
Goodness of trees for generalized books. Graphs Comb. 3(1): 1-6 (1987) - [j7]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Extremal problems involving neighborhood unions. J. Graph Theory 11(4): 555-564 (1987) - 1984
- [j6]Ronald J. Gould, Michael S. Jacobson:
Forbidden subgraphs and hamiitonian properties in the square of a connected graph. J. Graph Theory 8(1): 147-154 (1984) - 1983
- [j5]Ronald J. Gould, Michael S. Jacobson:
On the Ramsey number of trees versus graphs with large clique number. J. Graph Theory 7(1): 71-78 (1983) - 1982
- [j4]Ronald J. Gould, Michael S. Jacobson:
Forbidden subgraphs and Hamiltonian properties of graphs. Discret. Math. 42(2-3): 189-196 (1982) - [j3]Ronald J. Gould, Michael S. Jacobson:
Bounds for the ramsey number of a disconnected graph versus any graph. J. Graph Theory 6(4): 413-417 (1982) - 1981
- [j2]Ronald J. Gould:
On line graphs and the hamiltonian index. Discret. Math. 34(2): 111-117 (1981) - 1980
- [j1]Gary Chartrand, Ronald J. Gould, Albert D. Polimeni:
On ramsey numbers of forests versus nearly complete graphs. J. Graph Theory 4(2): 233-239 (1980)
Coauthor Index
[j110] [j107] [j105] [j104] [j101] [j96] [j95] [j93] [j92] [j91] [j90] [j87] [j85] [j84] [j82] [j81] [j80] [j77] [j74] [j63] [j60] [j59] [j58] [j55] [j54] [j53] [j52] [j46] [j45] [j39] [j36] [j35] [j34] [j30] [j29] [j28] [j27] [j25] [j24] [j23] [j21] [j17] [j16] [j15] [j14] [j12] [j11] [j10] [j8] [j7]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
