王维凡
基本信息Personal Information
教授
性别 : 男
毕业院校 : 南京大学
学历 : 博士研究生毕业
学位 : 博士学位
在职信息 : 在岗
所在单位 : 数学科学学院
入职时间 : 2002年05月01日
扫描关注
- [1]Wang, Weifan.On 3-colorable planar graphs without prescribed cycles..Discrete Math.2007,Vol.307 (No.22):2820-2825
- [2]Wei-fan Wang.Planar graphs without 4,6,8-cycles are 3-colorable.Science in China, Series A: Mathematics, Physics, Astronomy.2007,Vol.50 (NO.11):1552-1562
- [3]Chen Min.The 2-dipath chromatic number of Halin graphs.Information Processing Letters.2006,Vol.99 (NO.2):47-53
- [4]Chen, Min.Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable..Graphs and Combinatorics.2014,Vol.30 (No.4):861-874
- [5]王维凡.不含4,6,8-圈的平面图是3-可染的.中国科学A辑.2007,第37卷 (第8期):982-992
- [6]Chen, Min.List vertex-arboricity of toroidal graphs without [formula omitted]-cycles adjacent to [formula omitted]-cycles..Discrete Mathematics.2016,Vol.339 (No.10):2526-2535
- [7]Victor Loumngam?Kamga.2-Distance vertex-distinguishing index of subcubic graphs.Journal of Combinatorial Optimization.2018,Vol.36 (No.1):108-120
- [8]A note on the list vertex arboricity of toroidal graphs.Discrete Mathematics.2018,Vol.341 (No.12):3344-3347
- [9]Min Chen.On Choosability with Separation of Planar Graphs Without Adjacent Short Cycles.Bulletin of the Malaysian Mathematical Sciences Society.2018,Vol.41 (No.3):1507-1518
- [10]Xiaofang Luoa.On 3-colorable planar graphs without cycles of four lengths.Information Processing Letters.2007,Vol.103 (NO.4):150-156
- [11]Acyclic 6-choosability of planar graphs without adjacent short cycles.SCIENCE CHINA Mathematics
- [12]Weifan Wang.The surviving rate of an outerplanar graph for the firefighter problem.Theoretical Computer Science.2011,Vol.412 (No.8-10):913-921
- [13]Hao Gui.Equitable total-coloring of subcubic graphs.Discrete Applied Mathematics.2015,Vol.184 :167-170
- [14]Danjun Huang.Adjacent vertex distinguishing indices of planar graphs without 3-cycles.Discrete Mathematics.2015,Vol.338 (No.3):139-148
- [15]Yiqiao Wang.Some bounds on the neighbor-distinguishing index of graphs.Discrete Mathematics.2015,Vol.338 (No.11):2006-2013
- [16]Huang, Danjun.A note on the adjacent vertex distinguishing total chromatic number of graphs..Discrete Mathematics.2012,Vol.312 (No.24):3544-3546
- [17]Dong Chen.(2,1) -total labeling of trees with large maximum degree.Discrete Applied Mathematics.2015,Vol.187 :61-69
- [18]Qiaojun Shu.Acyclic chromatic indices of planar graphs with girth at least five.Journal of Combinatorial Optimization.2012,Vol.23 (No.1):140-157
- [19]Ye, CY.Fault tolerant path-embedding in locally twisted cubes.ARS COMBINATORIA.2012,Vol.107 :51-63
- [20]The surviving rate of planar graphs.THEORETICAL COMPUTER SCIENCE.2012,Vol.416 :65-70