|
基本信息Personal Information
教授
性别 : 男
毕业院校 : 南京大学
学历 : 博士研究生毕业
学位 : 博士学位
在职信息 : 退休
所在单位 : 数学科学学院
入职时间 : 2002年05月01日
扫描关注
- [161]Zhengke Miao.A sufficient condition for a tree to be \((\Delta +1)\) - \((2,1)\) -totally labelable.Journal of Combinatorial Optimization.2016,Vol.31 (No.2):893-901
- [162]Weifan Wang.The entire choosability of plane graphs.Journal of Combinatorial Optimization.2016,Vol.31 (No.3):1221-1240
- [163]王维凡.广义Mycielski图的边色数.浙江师范大学学报(自然科学版).2014,第37卷 (第3期):248-252
- [164]Acyclic chromatic indices of planar graphs with large girth.Discrete Applied Mathematics
- [165]Xu, Fengwei.Full orientability of the square of a cycle..Ars Combin..2015,Vol.122 :227-233
- [166]Wang, Yiqiao.PLANAR GRAPHS WITH triangle >= 9 ARE ENTIRELY (triangle+2)-COLORABLE.SIAM journal on discrete mathematics.2014,Vol.28 (No.4)
- [167]Wang, Weifan.Linear coloring of graphs without 4-cycles and embeddable in a surface of nonnegative Euler characteristic.UTILITAS MATHEMATICA.2014,Vol.95 :199-213
- [168]The 2-surviving rate of planar graphs without 6-cycles.Theoretical Computer Science
- [169]Weifan Wang.A new upper bound on the acyclic chromatic indices of planar graphs.European Journal of Combinatorics.2013,Vol.34 (No.2):338-354
- [170]Gao, Wei.NEW ISOLATED TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n) - CRITICAL GRAPH.COLLOQUIUM MATHEMATICUM.2017,Vol.147 (No.1):55-65
- [171]Gao, Wei.A TIGHT NEIGHBORHOOD UNION CONDITION ON FRACTIONAL (g, f,n \',m)-CRITICAL DELETED GRAPHS.COLLOQUIUM MATHEMATICUM.2017,Vol.149 (No.2):291-298
- [172]Wang, Yiqiao.The chromatic number of the square of a Halin graph with maximum degree five is six.ARS COMBINATORIA.2017,Vol.133 :217-231
- [173]Xiaoxue Hu.The entire chromatic number of graphs embedded on the torus with large maximum degree.Theoretical Computer Science.2017,Vol.689 :108-116
- [174]Shu, Qiaojun.A new sufficient condition for a tree T to have the (2,1)-total number.Journal of Combinatorial Optimization.2017,Vol.33 (No.3):1011-1020
- [175]Yiqiao Wang.Strong chromatic index of K<sub>4</sub>-minor free graphs.Information Processing Letters.2018,Vol.129 :53-56
- [176]Gao, Wei.Degree sum condition for fractional ID-$k$-factor-critical graphs..Miskolc Math. Notes.2017,Vol.18 (No.2):751-758
- [177]Weifan Wang.A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree.SIAM Journal on Discrete Mathematics.2015,Vol.29 (No.4):2412–2431
- [178]Weifan Wang.A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.Journal of Global Optimization.2016,Vol.65 (No.2):351-367
- [179]HUANG.Class I graphs of nonnegative characteristic without special cycles.高校应用数学学报(英文版).2012 (第3期):320-328
- [180]严丞超.围长至少为4的平面图的邻点可区别边色数.数学研究.2012 (第4期):331-341