Name
Abstract | ||
|---|---|---|
Sufficient conditions are given in terms of δ(G) and Δ(T), for a graph G with n vertices to contain a tree T with n vertices. One of these sufficient conditions is used to calculate some of the Ramsey numbers for the pair tree-star. Also necessary conditions are given, in terms of δ(G), for a graph G with n vertices to contain all trees with n vertices. |
Year | DOI | Venue |
|---|---|---|
1982 | 10.1016/0095-8956(82)90032-6 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
spanning tree | Graph center,Wheel graph,Trémaux tree,Combinatorics,Bound graph,Graph power,Neighbourhood (graph theory),Cycle graph,Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
32 | 2 | 0095-8956 |
Citations | PageRank | References |
3 | 0.52 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P Erdös | 1 | 626 | 190.85 |
| R.J. Faudree | 2 | 189 | 42.73 |
| C.C Rousseau | 3 | 29 | 8.57 |
| Richard H. Schelp | 4 | 274 | 61.72 |