A Bound on Vertex Distinguishing Total Coloring of Graphs with Distance Constraint for Recurrent Event Data

QIANG Huiying, LI Muchun, ZHANG Zhongfu

Acta Mathematicae Applicatae Sinica ›› 2011, Vol. 34 ›› Issue (3) : 554-559.

PDF(254 KB)
中国科学院数学与系统科学研究院期刊网
PDF(254 KB)
Acta Mathematicae Applicatae Sinica ›› 2011, Vol. 34 ›› Issue (3) : 554-559. DOI: 10.12387/C2011065
论文

A Bound on Vertex Distinguishing Total Coloring of Graphs with Distance Constraint for Recurrent Event Data

  • {{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, 2011, 34(3): 554-559 https://doi.org/10.12387/C2011065

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

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉