Every Connected, Almost Locally Connected $K_(1,3)$-Free Graph Is Fully Cycle Extendable

Jiang Lu WANG

Systems Engineering - Theory & Practice ›› 1999, Vol. 19 ›› Issue (11) : 121-123.

PDF(121 KB)
中国科学院数学与系统科学研究院期刊网
PDF(121 KB)
Systems Engineering - Theory & Practice ›› 1999, Vol. 19 ›› Issue (11) : 121-123. DOI: 10.12011/1000-6788(1999)11-121
论文

Every Connected, Almost Locally Connected $K_(1,3)$-Free Graph Is Fully Cycle Extendable

    {{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}}. Systems Engineering - Theory & Practice, 1999, 19(11): 121-123 https://doi.org/10.12011/1000-6788(1999)11-121

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

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉