|
基本信息Personal Information
教授
性别 : 男
毕业院校 : 南京大学
学历 : 博士研究生毕业
学位 : 博士学位
在职信息 : 退休
所在单位 : 数学科学学院
入职时间 : 2002年05月01日
扫描关注
- [141]Min Chen.A \((3,1)^{*}\) -choosable theorem on planar graphs.Journal of Combinatorial Optimization.2016,Vol.32 (No.3):927-940
- [142]Min Chen.A sufficient condition for planar graphs to be (3, 1)-choosable.Journal of Combinatorial Optimization.2017,Vol.34 (No.4):987-1011
- [143]WANG.Acyclic 6-choosability of planar graphs without adjacent short cycles.中国科学(数学)(英文版).2014 (第1期):197-209
- [144]Planar graphs with maximum degree 4 are strongly 19-edge-colorable.Discrete Mathematics.2018,Vol.341 (No.6):1629-1635
- [145]Weifan.Planar graphs without 4,6,8-cycles are 3-colorable.中国科学(A辑)(英文版).2007 (第11期):34-44
- [146]Min Chen.Star list chromatic number of planar subcubic graphs.Journal of Combinatorial Optimization.2014,Vol.27 (No.3):440-450
- [147]Min Chen.6-Star-Coloring of Subcubic Graphs.Journal of Graph Theory.2013,Vol.72 (No.2):128-145
- [148]Weifan Wang.Planar graphs without 4-cycles are acyclically 6-choosable.Journal of Graph Theory.2009,Vol.61 (No.4):307-323
- [149]Chen,Min.Acyclic 5-choosability of planar graphs without 4-cycles..Discrete Mathematics.2008,Vol.308 (No.24):6216-6225
- [150]Min Chen.Vertex-arboricity of planar graphs without intersecting triangles.European Journal of Combinatorics.2012,Vol.33 (No.5):905-923
- [151]Min Chena and Weifan Wang.On 3-colorable planar graphs without short cycles.Applied Mathematics Letters.2008,Vol.21 (No.9):961-965
- [152]Yan, Chengchao.Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five..J. Comb. Optim..2014,Vol.28 (No.4):893-909
- [153]Weifan Wang.Planar graphs without chordal 5-cycles are 2-good.Journal of Combinatorial Optimization.2018,Vol.35 (No.3):980-996
- [154]胡晓雪.2-连通的平面图的边面染色.中国科学(数学).2018 (第5期):671-686
- [155]Jingjing Huo.Neighbor Sum Distinguishing Index of Subcubic Graphs.Graphs and Combinatorics.2017,Vol.33 (No.2):419-431
- [156]Yiqiao Wang.A note on the linear 2-arboricity of planar graphs.Discrete Mathematics.2017,Vol.340 (No.7):1449-1455
- [157]Wei Gao.The eccentric connectivity polynomial of two classes of nanotubes.Chaos, Solitons and Fractals.2016,Vol.89 :290-294
- [158]Neighbor-sum-distinguishing edge choosability of subcubic graphs.Journal of Combinatorial Optimization.2017,Vol.34 (No.3):742-759
- [159]Tingting Wu.The 2-surviving rate of planar graphs without 5-cycles.Journal of Combinatorial Optimization.2016,Vol.31 (No.4):1479-1492
- [160]Yiqiao Wang.Edge-partition and star chromatic index.Applied Mathematics and Computation.2018,Vol.333 :480-489