A Sufficient Degree Condition for a Graph to Contain All Trees of Size k

Camino BALBUENA, Alberto MÁRQUEZ, José Ramón PORTILLO

Acta Mathematica Sinica ›› 2011, Vol. 27 ›› Issue (1) : 135-140.

PDF(172 KB)
中国科学院数学与系统科学研究院期刊网
AMS
PDF(172 KB)
Acta Mathematica Sinica ›› 2011, Vol. 27 ›› Issue (1) : 135-140. DOI: 10.1007/s10114-011-9617-6
Articles

A Sufficient Degree Condition for a Graph to Contain All Trees of Size k

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Acta Mathematica Sinica, 2011, 27(1): 135-140 https://doi.org/10.1007/s10114-011-9617-6

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(172 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉