#### Filter Results:

- Full text PDF available (84)

#### Publication Year

1980

2018

- This year (7)
- Last 5 years (27)
- Last 10 years (54)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ralph J. Faudree, Ronald J. Gould
- Discrete Mathematics
- 1997

- Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
- J. Comb. Theory, Ser. B
- 1989

We investigate the relationship between the cardinality of the union of the neighborhoods of an arbitrary pair of nonadjacent vertices and various hamiltonian type properties in graphs. Inâ€¦ (More)

- Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender
- Journal of Graph Theory
- 2002

An assignment of positive integer weights to the edges of a simple graph G is called irregular, if the weighted degrees of the vertices are all different. The irregularity strength, s(G), is theâ€¦ (More)

- Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
- Discrete Mathematics
- 2005

In this talk, we consider a minimum degree condition for a hamiltonian graph to have a 2-factor with two components. Let G be a graph of order n â‰¥ 3. Diracâ€™s theorem says that if the minimum degreeâ€¦ (More)

- Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito
- Journal of Graph Theory
- 2003

For a positive integer k, a graph G is k-ordered hamiltonian if for every ordered sequence of k vertices there is a hamiltonian cycle that encounters the vertices of the sequence in the given order.â€¦ (More)

- Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen
- Graphs and Combinatorics
- 2006

For a fixed multigraph H , possibly containing loops, with V (H) = {h1, . . . , hk}, we say a graph G is H -linked if for every choice of k vertices v1, . . . , vk in G, there exists a subdivision ofâ€¦ (More)

- Stephan Brandt, Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak
- Journal of Graph Theory
- 1997

For any positive integer k, we investigate degree conditions implying that a graph G of order n contains a 2-factor with exactly k components (vertex disjoint cycles). In particular, we prove thatâ€¦ (More)

- Ronald J. Gould, Michael S. Jacobson
- Discrete Mathematics
- 1982

We consider only finite undirected graphs without loops or multiple edges. Notation or terms not defined here can be found in [1]. Let G be a graph and let S Â£; V( G). The subgraph (S) induced by Sâ€¦ (More)

- Guantao Chen, Ronald J. Gould, Xingxing Yu
- Combinatorica
- 2003

Let G be a graph and u, v be two distinct vertices of G. A uâˆ’v path P is called nonseparating if G âˆ’ V (P ) is connected. The purpose of this paper is to study the number of nonseparating uâˆ’ v pathâ€¦ (More)

- Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
- Graphs and Combinatorics
- 2004

Given positive integers k m n, a graphG of order n is Ã°k;mÃž-pancyclic if for any set of k vertices of G and any integer r with m r n, there is a cycle of length r containing the k vertices. Minimumâ€¦ (More)