![]() |
基本信息Personal Information
教授
性别 : 男
毕业院校 : 南京大学
学历 : 博士研究生毕业
学位 : 博士学位
在职信息 : 退休
所在单位 : 数学科学学院
入职时间 : 2002年05月01日
扫描关注
- [181]黄丹君.高度平面图的邻点可区别全染色.中国科学(数学).2012 (第2期):151-164
- [182]Dan-jun Huang.Class I graphs of nonnegative characteristic without special cycles.Applied Mathematics-A Journal of Chinese Universities.2012,Vol.27 (No.3):320-328
- [183]Dai-Qiang Hu.Planar graphs without chordal 6-cycles are 4-choosable.Discrete Applied Mathematics.2018,Vol.244 :116-123
- [184]On Neighbor- Distinguishing Index of Planar Graphs.Journal of Graph Theory.2014 (No.3-4):262-278
- [185]Weifan Wang.Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable.Journal of Combinatorial Optimization :1-19
- [186]Chen,Yongzhu.Edge choosability of planar graphs without 5-cycles with a chord..Discrete Mathematics.2009,Vol.309 (No.8):2233-2238
- [187]Chen,Yongzhu.Improper choosability of graphs of nonnegative characteristic.Computers and Mathematics with Applications.2008,Vol.56 (No.8):2073-2078
- [188]Min Chen.On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree.Applied Mathematics and Computation.2018,Vol.326 :117-123
- [189]Min Chen.List vertex-arboricity of toroidal graphs without 4 -cycles adjacent to 3 -cycles.Discrete Mathematics.2016,Vol.339 (No.10):2526-2535
- [190]Gao, W.A neighborhood union condition for fractional (k, m)-deleted graphs.ARS COMBINATORIA.2014,Vol.113A :225-233
- [191]Wei.Some Results on Distance Two Labelling of Outerplanar Graphs.应用数学学报(英文版).2009,第25卷 (第1期):21-32
- [192]Gao, W.A note on fractional (g, f, m)-deleted graphs.ARS COMBINATORIA.2014,Vol.113A :129-137
- [193]王侃.围长至少为5的平面图的线性染色.数学研究.2011 (第1期):76-85
- [194]Wang.ENTIRE CHROMATIC NUMBER AND △-MATCHING OF OUTERPLANE GRAPHS.数学物理学报(B辑)(英文版).2005,第25卷 (第4期):672-680
- [195]叶彩月.超立方体网络的容错哈密顿Laceability<sup>*</sup>.浙江师范大学学报(自然科学版).2011 (第1期):46-50
- [196]Wei Gao.The Topological Variable Computation for a Special Type of Cycloalkanes.Journal of Chemistry.2017,Vol.2017
- [197]Lianzhu Zhang.An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph.Discrete Applied Mathematics.2014,Vol.162 :348-354
- [198]Weifan Wang.(2,1)-Total number of trees with maximum degree three.Information Processing Letters.2009,Vol.109 (No.14):805-810
- [199]WeiFan Wang.Linear coloring of graphs embeddable in a surface of nonnegative characteristic.Science in China, Series A: Mathematics, Physics, Astronomy.2009,Vol.52 (No.5):991-1003
- [200]舒巧君.2-外平面图的无圈边色数<sup>*</sup>.浙江师范大学学报(自然科学版).2011 (第4期):368-371