Neighbor Sum Distinguishing Total Choosability of Planar Graphs with Maximum Degree at Least 10

Dong-han ZHANG, You LU, Sheng-gui ZHANG, Li ZHANG

应用数学学报(英文版) ›› 2024, Vol. 40 ›› Issue (1) : 211-224.

PDF(216 KB)
中国科学院数学与系统科学研究院期刊网
PDF(216 KB)
应用数学学报(英文版) ›› 2024, Vol. 40 ›› Issue (1) : 211-224. DOI: 10.1007/s10255-024-1110-y
ARTICLES

Neighbor Sum Distinguishing Total Choosability of Planar Graphs with Maximum Degree at Least 10

    Dong-han ZHANG1,2, You LU1, Sheng-gui ZHANG1, Li ZHANG1
作者信息 +

Neighbor Sum Distinguishing Total Choosability of Planar Graphs with Maximum Degree at Least 10

    Dong-han ZHANG1,2, You LU1, Sheng-gui ZHANG1, Li ZHANG1
Author information +
文章历史 +

本文亮点

{{article.keyPoints_cn}}

HeighLight

{{article.keyPoints_en}}

摘要

{{article.zhaiyao_cn}}

Abstract

{{article.zhaiyao_en}}

关键词

Key words

本文二维码

引用本文

EndNote

Ris (Procite)

Bibtex

导出引用
{{article.zuoZheCn_L}}. {{article.title_cn}}. {{journal.qiKanMingCheng_CN}}, 2024, 40(1): 211-224 https://doi.org/10.1007/s10255-024-1110-y
{{article.zuoZheEn_L}}. {{article.title_en}}. {{journal.qiKanMingCheng_EN}}, 2024, 40(1): 211-224 https://doi.org/10.1007/s10255-024-1110-y
中图分类号：

参考文献

原文顺序 | 文献年度倒序 | 文中引用次数倒序

参考文献

{{article.reference}}

基金

版权

{{article.copyrightStatement_cn}}
{{article.copyrightLicense_cn}}
PDF(216 KB)

Accesses

Citation

Detail
段落导航
相关文章

/

〈 〉