|
基本信息Personal Information
教授
性别 : 男
毕业院校 : 南京大学
学历 : 博士研究生毕业
学位 : 博士学位
在职信息 : 退休
所在单位 : 数学科学学院
入职时间 : 2002年05月01日
扫描关注
- [41]Melnikov猜想Δ=4情形的一个证明.科学通报.1998,第43卷 (第3期):330-331
- [42]A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS.数学物理学报(英文版).2001,第21卷 (第2期):243-248
- [43]On the vertex face total chromatic number of planar graphs.Journal of Graph Theory.1996,Vol.22 (No.1):29-37
- [44]A proof of Melnikov＇s conjecture for case ...=4..Chinese Science Bulletin.1998,Vol.43 (NO.4):352-352
- [45]The total chromatic number of pseudo-outerplanar graphs.Applied Mathematics-A Journal of Chinese Universities.1997,Vol.12 (No.4):455-462
- [46]Choosability and edge choosability of planar graphs without five cycles.Applied Mathematics Letters.2002,Vol.15 (NO.5):561-565
- [47]A new proof of Melnikov＇s conjecture on the edge-face coloring of plane graphs.Discrete Mathematics.2002,Vol.253 (NO.1):87-95
- [48]Edge-partitions of planar graphs and their game coloring numbers.Journal of Graph Theory.2002,Vol.41 (NO.4):307-317
- [49]王维凡.不含4-和5-圈的平面图的均匀染色.浙江师范大学学报(自然科学版).2014 (第1期):1-6
- [50]Chuandong Xu.Rainbow cliques in edge-colored graphs.European Journal of Combinatorics.2016,Vol.54 :193-200
- [51]Xiaoxue Hu.Plane graphs with maximum degree 9 are entirely 11-choosable.Discrete Mathematics.2016,Vol.339 (No.11):2742-2753
- [52]Jiangxu Kong.The surviving rate of digraphs.Discrete Mathematics.2014,Vol.334 :13-19
- [53]Xiaoxue Hu.The edge-face choosability of plane graphs with maximum degree at least 9.Discrete Mathematics.2014,Vol.327 :1-8
- [54]陈东.最大度为3的树的L（2,1）-标号数的一个刻画.数学学报.2016,第59卷 (第5期):685-710
- [55]Weifan Wang.Acyclic edge coloring of planar graphs without 4-cycles.Journal of Combinatorial Optimization.2013,Vol.25 (No.4):562-586
- [56]Qiaojun Shu.Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4.Journal of Graph Theory.2013,Vol.73 (No.4):386-399
- [57]Yiqiao Wang.The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle.Discrete Applied Mathematics.2013,Vol.161 (No.16-17):2687–2694
- [58]Weifan Wang.A lower bound of the surviving rate of a planar graph with girth at least seven.Journal of Combinatorial Optimization.2014,Vol.27 (No.4):621-642
- [59]Gao, W.Degree conditions for fractional (k, m)-deleted graphs.ARS COMBINATORIA.2014,Vol.113A :273-285
- [60]Gao, W.Binding number and fractional (g, f, n ', m)-critical deleted graph.ARS COMBINATORIA.2014,Vol.113A :49-64