The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ronald J. Gould: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guantao Chen, Ronald J. Gould, Florian Pfender
    New Conditions for k-ordered Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:70, n:, pp:- [Journal]
  2. Jill R. Faudree, Ronald J. Gould
    A Note on Neighborhood Unions and Independent Cycles. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:76, n:, pp:- [Journal]
  3. Allen G. Fuller, Ronald J. Gould
    Path Spectra and Forbidden Families. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  4. Guantao Chen, Ronald J. Gould, Xingxing Yu
    Graph Connectivity After Path Removal. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:185-203 [Journal]
  5. Jill R. Faudree, Ronald J. Gould, Florian Pfender, Allison Wolf
    On k-Ordered Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  6. Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak
    Generalized Degrees and Menger Path Systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:179-191 [Journal]
  7. Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel
    Edge disjoint monochromatic triangles in 2-colored graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:135-141 [Journal]
  8. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
    Characterizing forbidden clawless triples implying hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:71-81 [Journal]
  9. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
    Toughness, degrees and 2-factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:3, pp:245-249 [Journal]
  10. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
    A note on 2-factors with two components. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:218-224 [Journal]
  11. Ronald J. Gould, Florian Pfender
    Pancyclicity in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:151-160 [Journal]
  12. Ronald J. Gould
    Results on degrees and the structure of 2-factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:99-111 [Journal]
  13. Ronald J. Gould, Michael S. Jacobson
    Two-factors with few cycles in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:191-197 [Journal]
  14. Ronald J. Gould, John R. Schmitt
    Minimum degree and the minimum size of K22-saturated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1108-1114 [Journal]
  15. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
    Generalizing Pancyclic and k-Ordered Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:3, pp:291-309 [Journal]
  16. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
    Minimal Degree and (k, m)-Pancyclic Ordered Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:2, pp:197-211 [Journal]
  17. Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen
    On H-Linked Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:2, pp:217-224 [Journal]
  18. Ronald J. Gould
    Advances on the Hamiltonian Problem - A Survey. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:1, pp:7-52 [Journal]
  19. Ronald J. Gould, Penny E. Haxell, A. D. Scott
    A Note on Cycle Lengths in Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:3, pp:491-498 [Journal]
  20. Guantao Chen, Ralph J. Faudree, Ronald J. Gould
    Intersections of Longest Cycles in k-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:143-149 [Journal]
  21. Guantao Chen, Ronald J. Gould, Hao Li
    Partitioning Vertices of a Tournament into Independent Cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:213-220 [Journal]
  22. Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei
    Extremal graphs for intersecting cliques. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:89, n:2, pp:159-171 [Journal]
  23. Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson
    Extremal Graphs for Intersecting Triangles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:1, pp:89-100 [Journal]
  24. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
    Neighborhood unions and hamiltonian properties in graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:1, pp:1-9 [Journal]
  25. Guantao Chen, Ronald J. Gould, K. Kawarabayashi, Florian Pfender, Bing Wei
    Graph minors and linkages. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:1, pp:75-91 [Journal]
  26. Ronald J. Gould, Tomasz Luczak, Florian Pfender
    Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:3, pp:183-202 [Journal]
  27. Ronald J. Gould
    On line graphs and the hamiltonian index. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:2, pp:111-117 [Journal]
  28. Ronald J. Gould, Michael S. Jacobson
    Forbidden subgraphs and Hamiltonian properties of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:42, n:2-3, pp:189-196 [Journal]
  29. Ronald J. Gould, Robert Roth
    Cayley digraphs and (1, j, n)-sequencings of the alternating groups An. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:91-102 [Journal]
  30. Ronald J. Gould, John M. Harris
    Forbidden triples and traceability: a characterization. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:101-120 [Journal]
  31. Guantao Chen, Ronald J. Gould, Michael S. Jacobson
    On 2-factors containing 1-factors in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:185-194 [Journal]
  32. Ronald J. Gould, John M. Harris
    Traceability in graphs with forbidden triples of subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:189, n:1-3, pp:123-132 [Journal]
  33. Ralph J. Faudree, Ronald J. Gould
    Characterizing forbidden pairs for hamiltonian properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:173, n:1-3, pp:45-60 [Journal]
  34. Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak
    Neighborhood conditions and edge-disjoint perfect matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:1, pp:33-43 [Journal]
  35. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:1, pp:17-24 [Journal]
  36. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
    Neighborhood unions and a generalization of Dirac's theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:105, n:1-3, pp:61-71 [Journal]
  37. Ronald J. Gould, Vojtech Rödl
    On isomorphic subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:259-262 [Journal]
  38. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
    Degree conditions and cycle extendability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:109-122 [Journal]
  39. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
    Graph spectra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:103-113 [Journal]

  40. Distance between two k-sets and Path-Systems Extendibility. [Citation Graph (, )][DBLP]


  41. Graphic Sequences with a Realization Containing a Friendship Graph. [Citation Graph (, )][DBLP]


  42. Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size. [Citation Graph (, )][DBLP]


  43. An iterative approach to graph irregularity strength. [Citation Graph (, )][DBLP]


  44. Graphic sequences with a realization containing a complete multipartite subgraph. [Citation Graph (, )][DBLP]


  45. Minimum degree and pan-k-linked graphs. [Citation Graph (, )][DBLP]


  46. Disjoint hamiltonian cycles in bipartite graphs. [Citation Graph (, )][DBLP]


  47. A look at cycles containing specified elements of a graph. [Citation Graph (, )][DBLP]


  48. Pancyclic graphs and linear forests. [Citation Graph (, )][DBLP]


  49. tKp-saturated graphs of minimum size. [Citation Graph (, )][DBLP]


Search in 0.177secs, Finished in 0.179secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002