Maximum (Minimum) Almost Resolvable (4,2)-cycle Packing (Covering) of a Complete Graph

WANG Changyuan, CAO Haitao

Acta Mathematicae Applicatae Sinica ›› 2015, Vol. 38 ›› Issue (1) : 183-192.

PDF(316 KB)
中国科学院数学与系统科学研究院期刊网
PDF(316 KB)
Acta Mathematicae Applicatae Sinica ›› 2015, Vol. 38 ›› Issue (1) : 183-192. DOI: 10.12387/C2015017

Maximum (Minimum) Almost Resolvable (4,2)-cycle Packing (Covering) of a Complete Graph

  • {{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, 2015, 38(1): 183-192 https://doi.org/10.12387/C2015017

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

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉