Sorry, we do not have enough data to show an influence graph for this author.
- Full text PDF available (0)
Journals and Conferences
In this note a shortened proof is given for the Faudree-Schelp theorem on path-connected graphs. We consider ordinary graphs, i.e., finite, undirected graphs without loops or multiple edges. Let Pdu, u) denote a u-u path of length 1 1 in a graph G . A graph G is said to satisfy property Pi if Pi(u , u) exists for all distinct pairs u, u in V(G). Let [A, B ]… (More)