李德明,博士,首都师范大学数学科学学院副教授、硕导。研究方向

李德明，博士，首都师范大学数学科学学院副教授、硕导。研究方向各位读友大家好，此文档由网络收集而来，欢迎您下载，谢谢

中文名,李德明。职业,副教授。李德明硕导。毕业院校,北京交通大学。代表作品,清理三角债问题的优化数学模型及其解法。学位,博士。研究方向,图论。组合最优化。

人物简介。职称：副教授。硕导学位：博士毕业院校：北京交通大学研究方向：图论。

组合最优化。

主要论著。29. Incidence colorings of powers of circuits,28. Haj os’ conjecture and cycle power graphs,26. List extremal number of union of short cycles,27. Incidence coloring of the squares of some graphs,25. 直径为三的不可上嵌入的

图,24. Hadwiger’s conjecture for powers of cycles and their complements,23. On the decay number of a graph,22. The Genus distributions of Mobius ladders21. 由轮图导出的某些平面图的星色数20. The star chromatic numbers of some planar graphs derived from wheels19. Some planar graphs with star chromatic number between 3 and 4 Journal of Mathematical Research and Exposition, V ol 21 Issue 4 500—Finding a smooth frame decomposition of a graph Chinese Quarterly Journal of Mathematics, V ol 16 Issue 3 75—7917. On 3-connected cubic graphs whose maximum genus attains the lower bound J. Xinyang Teachers College 14;2 138-14316. Maximum genus and structures of 2-connected cubic simplicial graphs J. Xinyang Teachers College 14;1 4-1115. The lower bounds on the maximum genus of loopless multigraphs Applied Mathematics A Journal of Chinese

Universities . 15:4, 359-36814. Maximum genus, girth and connectivity European Journal of Combinatorics. 21 , 651-65713.

A relative maximum genus graph embedding and its local maximum genus Acta Mathematicae Applicatae Sinica . 16:4 366--37212. A tight lower bound on the maximum genus of a 3-connected loopless multigraph Applied Mathematics A Journal of Chinese Universities. 15:4 369--37611. Genus distribution of circular ladders Northeastern Mathematics Journal 16:2 , 181-18910. A polynomial algorithm for finding the minimum feedback vertex set of a 3-regular simplicial graph Acta Mathematica Scientia , 19: 4 375–3819.

A tight lower bound on the maximum genus of 3-edge connected loopless graphs Acta Mathematicae Applicatae Sinica . 15:4 361-3678. The star chromatic numbers of some graphs 《数学进展》, 28:3 259 – 2657. The maximum genus of

a 3-regular simplicial graph Applied Mathematics A Journal of Chinese Universities . 14: 2 203-2146. An efficient algorithm for finding an adjacency matching of a graph Journal of Northern Jiaotong University , 23:2 23-275. The smallest non-upper embeddable 2-connected 3-regular simplicial graphs 北方交通大学学报, 22:2 5-84. The number of a 4-regular planar Hamilton maps 北方交通大学学报, 21:5 548-5533. 层次分析中最小偏差法的性质系统工程理论与实践, 16:7 36-392. 星点临界图的性质曲阜师范大学学报, 21:5 42-431. 清理三角债问题的优化数学模型及其解法曲阜师范大学学报, 21:2 61-64。

教学活动。组合数学数学科学学院109人3学时/周概率方法09研究生流与覆盖09研究生离散数学数学系120人3学时/周组合数学数学系93人3学时/周离散数学数学系18