|
基本信息Personal Information
教授
性别 : 男
毕业院校 : 南京大学
学历 : 博士研究生毕业
学位 : 博士学位
在职信息 : 退休
所在单位 : 数学科学学院
入职时间 : 2002年05月01日
扫描关注
- [21]Weifan Wang.Entire colouring of plane graphs.Journal of Combinatorial Theory. Series B.2011,Vol.101 (No.6):490-501
- [22]Yiqiao Wang.Adjacent vertex distinguishing total colorings of outerplanar graphs.Journal of Combinatorial Optimization.2010,Vol.19 (No.2):123-133
- [23]Weifan Wang.Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree.Journal of Combinatorial Optimization.2010,Vol.19 (No.4):471-485
- [24]Weifan Wang.An improved bound on parity vertex colourings of outerplane graphs.Discrete Mathematics.2012,Vol.312 (No.18):2782-2787
- [25]Weifan Wang.The 2-surviving rate of planar graphs without 4-cycles.Theoretical Computer Science.2012,Vol.457 :158-165
- [26]Weifan Wang.On backbone coloring of graphs.Journal of Combinatorial Optimization.2012,Vol.23 (No.1):79-93
- [27]Huang, DJ.A Note on General Neighbor-Distinguishing Total Coloring of Graphs.ARS COMBINATORIA.2012,Vol.107 :379-384
- [28]Qiaojun Shu.Acyclic edge coloring of planar graphs without 5-cycles.Discrete Applied Mathematics.2012,Vol.160 (No.7-8):1211-1223
- [29]Danjun Huang.On the vertex-arboricity of planar graphs without 7-cycles.Discrete Mathematics.2012,Vol.312 (No.15):2304-2315
- [30]Wang,Weifan.The surviving rate of an infected network..Theoretical Computer Science.2010,Vol.411 (No.40-42):3651-3660
- [31]Min Chen.Some results on the injective chromatic number of graphs.Journal of Combinatorial Optimization.2012,Vol.24 (No.3):299-318
- [32]Leizhen Cai.Choosability of toroidal graphs without short cycles.Journal of Graph Theory.2010,Vol.65 (No.1):1-15
- [33]Lan Shen.On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles.Applied Mathematics Letters.2009,Vol.22 (No.9):1369-1373
- [34]Wei-Fan Wang.Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers.Discrete Mathematics.2006,Vol.306 (NO.2):262-270
- [35]Huang, Danjun.Planar graphs of maximum degree six without 7-cycles are class one..Electron. J. Combin..2012,Vol.19 (No.3):17
- [36]Huang, Dan-jun.Class I graphs of nonnegative characteristic without special cycles..Appl. Math. J. Chinese Univ. Ser. B.2012,Vol.27 (No.3):320-328
- [37]YingQian Wang.On 3-colorability of planar graphs without adjacent short cycles.Science in China, Series A: Mathematics, Physics, Astronomy.2010,Vol.53 (No.4):1129-1132
- [38]Chen, Min.8-star-choosability of a graph with maximum average degree less than 3..Discrete Math. Theor. Comput. Sci..2011,Vol.13 (No.3):97-110
- [39]Δ—匹配与边面全色数.应用数学学报.1999,第22卷 (第2期):236-242
- [40]超图中着色问题.数学进展.2000 (第2期):115-136