Wang Weifan

发表

Plane graphs with maximum degree 5 are 11-linear-colorable

Wang Kan, Wang Weifan, 2012 .

On the firefighter problem of Halin graphs

Wang Weifan, 2011 .

Upper Bounds of Entire Chromatic Number of Plane Graphs

Wang Weifan, Wang Weifan, 1999 .

L ( p, q )-labelling of K 4 -minor free graphs

Wang Weifan, Wang Yiqiao, 2006 .

EQUITABLE COLORINGS OF LINE GRAPHS AND COMPLETE r-PARTITE GRAPHS

Wang Weifan, 2000 .

A proof of Melnikov’s conjecture for case Δ = 4

Wang Weifan, Zhang Kemin, Wang Weifan, 1998 .

On the vertex face total chromatic number of planar graphs

Wang Weifan, Liu Jia-zhuang, 1996 .

The(2,1)-total labelling of the product of two kinds of graphs

Wang Weifan, 2006 .

Hamiltonian laceability of faulty hypercubes

Wang Weifan, 2011 .

Edge choosability of planar graphs without short cycles

Wang Weifan, 2005 .

The 2-dipath chromatic number of Halin graphs

Wang Weifan, Chen Min, 2006 .

The Surviving Rate of a Graph for the Firefighter Problem

Wang Weifan, Cai Leizhen, 2009 .