| 2009 |
|---|
| 9 | EE | Xiang-Yong Sun,
Jian-Liang Wu,
Yu-Wen Wu,
Jian-Feng Hou:
Total colorings of planar graphs without adjacent triangles.
Discrete Mathematics 309(1): 202-206 (2009) |
| 2008 |
|---|
| 8 | | Jian-Liang Wu,
Yu-Liang Wu:
The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree.
Ars Comb. 86: (2008) |
| 7 | EE | Jian-Liang Wu,
Yu-Wen Wu:
The linear arboricity of planar graphs of maximum degree seven is four.
Journal of Graph Theory 58(3): 210-220 (2008) |
| 2007 |
|---|
| 6 | EE | Jian-Liang Wu,
Ping Wang:
A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs.
International Conference on Computational Science (3) 2007: 389-396 |
| 2006 |
|---|
| 5 | | Lian-Cui Zuo,
Jian-Liang Wu,
Jia-Zhuang Liu:
The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set.
Ars Comb. 79: (2006) |
| 4 | | Lian-Cui Zuo,
Jian-Liang Wu,
Jia-Zhuang Liu:
The Fractional Vertex Linear Arboricity of Graphs.
Ars Comb. 81: (2006) |
| 2005 |
|---|
| 3 | | Jian-Liang Wu,
Ping Wang,
Anthony J. W. Hilton:
Two sufficient conditions for a graph to be type 1.
Ars Comb. 76: (2005) |
| 2004 |
|---|
| 2 | | Jian-Liang Wu,
Daiqiang Hu:
Total Coloring of Series-Parallel Graphs.
Ars Comb. 73: (2004) |
| 1 | EE | Peter Dankelmann,
Ortrud Oellermann,
Jian-Liang Wu:
Minimum average distance of strong orientations of graphs.
Discrete Applied Mathematics 143(1-3): 204-212 (2004) |
