|
基本信息Personal Information
教授
性别 : 男
毕业院校 : 加拿大卡尔加里大学
学历 : 博士研究生毕业
学位 : 博士学位
在职信息 : 在岗
所在单位 : 数学科学学院
入职时间 : 2010年06月25日
学科 : 数学与应用数学
Email :
扫描关注
- [21]Yunfang Tang.Total weight choosability of graphs with bounded maximum average degree.Discrete Mathematics.2017,Vol.340 (No.8):2033-2042
- [22]Jaehoon Kim.Improper coloring of sparse graphs with a given girth, I: (0,1)-colorings of triangle-free graphs.European Journal of Combinatorics.2014,Vol.42 :26-48
- [23]Zhu, Xuding.Multiple list colouring of planar graphs..J. Combin. Theory Ser. B.2017,Vol.122 :794-799
- [24]Bu, Yuehua.Backbone coloring for graphs with large girths..Discrete Mathematics.2013,Vol.313 (No.18):1799-1804
- [25]Daniel W. Cranston.Regular Graphs of Odd Degree Are Antimagic.Journal of Graph Theory.2015,Vol.80 (No.1):28-33
- [26]Liang, Yu-Chang.Anti-magic labeling of trees..Discrete Mathematics.2014,Vol.331 :9-14
- [27]Cheyu Lin.Circular Chromatic Indices of Regular Graphs.Journal of Graph Theory.2014,Vol.76 (No.3):169-193
- [28]Huang, Po-Yi.Erratum to "Application of polynomial method to on-line list colouring of graphs'' [European J. Combin. 33 (2012) 872–883]..European Journal of Combinatorics.2014,Vol.38 :23
- [29]Jonathan A. Noel.Beyond Ohba’s Conjecture: A bound on the choice number of k -chromatic graphs with n vertices.European Journal of Combinatorics.2015,Vol.43 :295-305
- [30]D. J. Guan.Preface: optimization in graphs.Journal of Combinatorial Optimization.2013,Vol.25 (No.4):499-500
- [31]Huang, PY.Application of polynomial method to on-line list colouring of graphs (vol 33, pg 872, 2012).European Journal of Combinatorics.2014,Vol.38 :23
- [32]Yuehua Bu.List backbone colouring of graphs.Discrete Applied Mathematics.2014,Vol.167 :45-51
- [33]Kyle F. Jao.Circular chromatic Ramsey number.Journal of Combinatorics.2017,Vol.8 (No.1):189-208
- [34]Balakrishnan, R..Preface..Discrete Mathematics.2012,Vol.312 (No.9):1493
- [35]ZHISHI PAN.MULTIPLE COLORING OF CONE GRAPHS.SIAM journal on discrete mathematics.2011,Vol.25 (No.4)
- [36]Wai Hong Chan.The strong game colouring number of directed graphs.Discrete Mathematics.2013,Vol.313 (No.10):1070-1077
- [37]Jonathan A. Noel.Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond.Electronic Notes in Discrete Mathematics.2013,Vol.43 :89–95
- [38]Noel, Jonathan A..Beyond Ohba’s Conjecture: A bound on the choice number of [formula omitted]-chromatic graphs with [formula omitted] vertices..European Journal of Combinatorics.2015,Vol.43 :295-305
- [39]Xuding Zhu.The Alon–Tarsi number of planar graphs.Journal of Combinatorial Theory, Series B.2018
- [40]Rongxing Xu.Bounded Greedy Nim.Theoretical Computer Science.2018