ON GRAPHS WHICH CONTAIN ALL TREES WITH n EDGES I——A LOWER BOUND OF s(Jn)

Yang Wan-lan

Acta Mathematicae Applicatae Sinica ›› 1985, Vol. 8 ›› Issue (3) : 284-292.

PDF(2584 KB)
中国科学院数学与系统科学研究院期刊网
PDF(2584 KB)
Acta Mathematicae Applicatae Sinica ›› 1985, Vol. 8 ›› Issue (3) : 284-292. DOI: 10.12387/C1985034

ON GRAPHS WHICH CONTAIN ALL TREES WITH n EDGES I——A LOWER BOUND OF s(Jn)

  • {{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 Mathematicae Applicatae Sinica, 1985, 8(3): 284-292 https://doi.org/10.12387/C1985034

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(2584 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉