Abstract
An ordinary graphG will be calledpanarboreal if it contains all possible trees, i.e. if, for every treeT with |V(T)|=|V(G)|,G has a subgraph which is isomorphic toT. We derive sufficient conditions for a graphG to be panarboreal in terms of Δ(G) and δ(G).
Similar content being viewed by others
References
F. R. K. Chung and R. L. Graham,On graphs which contain all small trees, J. Combinatorial Theory Ser. B24 (1978), 14–23.
F. R. K. Chung and R. L. Graham,On universal graphs for spanning trees, to appear.
V. Chvátal,Tree-complete graph Ramsey numbers, J. Graph Theory1 (1977), 93.
P. Erdös, R. J. Faudree, C. C. Rousseau and R. H. Schelp,On the extremal problem for complete bipartite graphs, to appear.
F. Harary,Graph Theory, Addison-Wesley, Reading, Mass. 1969.
L. Nebesky,On tree-complete graphs, Časopis Pěst. Mat. 100 (1975), 334–338.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Faudree, R.J., Rousseau, C.C., Schelp, R.H. et al. Panarboreal graphs. Israel J. Math. 35, 177–185 (1980). https://doi.org/10.1007/BF02761188
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02761188