Paper achievements
- Weifan Wang.A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.Journal of Global Optimization.2016,Vol.65(No.2):351-367
- Weifan Wang.A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree.SIAM Journal on Discrete Mathematics.2015,Vol.29(No.4):2412–2431
- 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
MOBILE Version