Indexed by：
Abstract：
The Loebl-Komlós-Sós conjecture says that any graph G on n vertices with at least half of its vertices of degree at least k contains every tree with k edges. We prove that the conjecture is true for trees of diameter at most 4 and for spiders of diameter at most 5.
Keyword：
Reprint 's Address：
Email：
Source ：
Australasian Journal of Combinatorics
ISSN： 1034-4942
Year： 2007
Volume： 37
Page： 271-275
0 . 4 0 0
JCR@2023
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
