Disjoint K4- in claw-free graphs with minimum degree at least five

{{article.zuoZheEn}}

PDF(177 KB)
PDF(177 KB)
Front. Math. China ›› 2015, Vol. 10 ›› Issue (1) : 53-68. DOI: 10.1007/s11464-014-0434-y
RESEARCH ARTICLE

Disjoint K4- in claw-free graphs with minimum degree at least five

  • {{article.zuoZheEn}}
Author information +
History +

Highlights

{{article.highlightEn}}

Abstract

{{article.abstractEn}}

Author summary

{{article.authorSummayEn}}

Keywords

Cite this article

EndNote

Ris (Procite)

Bibtex

Download citation ▾
{{article.zuoZheEn_L}}. {{article.titleEn}}. Front. Math. China, 2015, 10(1): 53‒68 https://doi.org/10.1007/s11464-014-0434-y

References

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

References

{{article.reference}}

RIGHTS & PERMISSIONS

{{article.copyright.year}} {{article.copyright.holder}}
K4- in claw-free graphs with minimum degree at least five" title="Share on Weibo" target="_blank">
PDF(177 KB)

Accesses

Citations

Detail
Sections
Recommended

/

〈 〉