Search the dblp DataBase

Publications of Author

1. Jian-Liang Wu, Daiqiang Hu
   Total Coloring of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 2004, v:73, n:, pp:- [Journal]
   
2. Jian-Liang Wu, Ping Wang, Anthony J. W. Hilton
   Two sufficient conditions for a graph to be type 1. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 2005, v:76, n:, pp:- [Journal]
   
3. Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu
   Minimum average distance of strong orientations of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:204-212 [Journal]
   
4. Lian-ying Miao, Shi-you Pang, Jian-Liang Wu
   An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:271, n:1-3, pp:321-325 [Journal]
   
5. Lian-ying Miao, Jian-Liang Wu
   Edge-coloring critical graphs with high degree. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:257, n:1, pp:169-172 [Journal]
   
6. Jian-Liang Wu, Ping Wang
   A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
   International Conference on Computational Science (3), 2007, pp:389-396 [Conf]
   
7. 
   The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree. [Citation Graph (, )][DBLP]
   
   
8. 
   The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set. [Citation Graph (, )][DBLP]
   
   
9. 
   The Fractional Vertex Linear Arboricity of Graphs. [Citation Graph (, )][DBLP]
   
   
10. 
    Planar graphs without 5-cycles or without 6-cycles. [Citation Graph (, )][DBLP]
    
    
11. 
    Vertex arboricity of integer distance graph G(D_{m, k}). [Citation Graph (, )][DBLP]