Search the dblp DataBase

Publications of Author

1. Yuehua Bu, Weifan Wang
   Some sufficient conditions for a planar graph of maximum degree six to be Class 1. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:13, pp:1440-1445 [Journal]
   
2. Mickaël Montassier, André Raspaud, Weifan Wang
   Bordeaux 3-color conjecture and 3-choosability. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:6, pp:573-579 [Journal]
   
3. Weifan Wang
   Upper Bounds of Entire Chromatic Number of Plane Graphs. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1999, v:20, n:4, pp:313-315 [Journal]
   
4. Weifan Wang, Yiqiao Wang 0002
   L(p, q)-labelling of K₄-minor free graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:98, n:5, pp:169-173 [Journal]
   
5. Min Chen, Weifan Wang
   The 2-dipath chromatic number of Halin graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:2, pp:47-53 [Journal]
   
6. Min Chen, André Raspaud, Weifan Wang
   Three-coloring planar graphs without short cycles. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:3, pp:134-138 [Journal]
   
7. Weifan Wang, Ko-Wei Lih
   Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2002, v:15, n:4, pp:538-545 [Journal]
   
8. Weifan Wang, Ko-Wei Lih
   Labeling Planar Graphs with Conditions on Girth and Distance Two. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2003, v:17, n:2, pp:264-275 [Journal]
   
9. Mickaël Montassier, André Raspaud, Weifan Wang
   Acyclic 5-choosability of planar graphs without small cycles. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2007, v:54, n:3, pp:245-260 [Journal]
   
10. Weifan Wang
    Total chromatic number of planar graphs with maximum degree ten. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:2, pp:91-102 [Journal]
    
11. Weifan Wang
    On the colorings of outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:257-269 [Journal]
    
12. Xiaofang Luo, Min Chen, Weifan Wang
    On 3-colorable planar graphs without cycles of four lengths. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:4, pp:150-156 [Journal]
    
13. Weifan Wang, Yongzhu Chen
    A sufficient condition for a planar graph to be class 1. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:71-77 [Journal]
    
14. 
    On 3-colorable planar graphs without short cycles. [Citation Graph (, )][DBLP]
    
    
15. 
    (2, 1)-Total labelling of outerplanar graphs. [Citation Graph (, )][DBLP]
    
    
16. 
    Labelling planar graphs without 4-cycles with a condition on distance two. [Citation Graph (, )][DBLP]
    
    
17. 
    Injective coloring of planar graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    On 3-colorable planar graphs without prescribed cycles. [Citation Graph (, )][DBLP]
    
    
19. 
    Acyclic 5-choosability of planar graphs without 4-cycles. [Citation Graph (, )][DBLP]
    
    
20. 
    Diameters of uniform subset graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. [Citation Graph (, )][DBLP]
    
    
22. 
    The edge-face coloring of graphs embedded in a surface of characteristic zero. [Citation Graph (, )][DBLP]
    
    
23. 
    Edge choosability of planar graphs without 5-cycles with a chord. [Citation Graph (, )][DBLP]
    
    
24. 
    Linear coloring of planar graphs with large girth. [Citation Graph (, )][DBLP]
    
    
25. 
    On the vertex-arboricity of planar graphs. [Citation Graph (, )][DBLP]