| 2008 |
|---|
| 8 | EE | He Chen,
Zemin Jin,
Xueliang Li,
Jianhua Tu:
Heterochromatic tree partition numbers for complete bipartite graphs.
Discrete Mathematics 308(17): 3871-3878 (2008) |
| 7 | EE | Zemin Jin,
Xueliang Li:
Graphs with the second largest number of maximal independent sets.
Discrete Mathematics 308(23): 5864-5870 (2008) |
| 2007 |
|---|
| 6 | EE | Zemin Jin,
Huifang Yan,
Qinglin Yu:
Generalization of matching extensions in graphs (II).
Discrete Applied Mathematics 155(10): 1267-1274 (2007) |
| 5 | EE | Zemin Jin,
Xingxing Yu,
Xiaoyan Zhang:
Contractible subgraphs in k-connected graphs.
Journal of Graph Theory 55(2): 121-136 (2007) |
| 2006 |
|---|
| 4 | EE | Xiaolong Huang,
Zemin Jin,
Xingxing Yu,
Xiaoyan Zhang:
Contractible Cliques in k-Connected Graphs.
Graphs and Combinatorics 22(3): 361-370 (2006) |
| 3 | EE | Zemin Jin,
Mikio Kano,
Xueliang Li,
Bing Wei:
Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees.
J. Comb. Optim. 11(4): 445-454 (2006) |
| 2 | EE | Zemin Jin,
Xueliang Li:
On the k-path cover problem for cacti.
Theor. Comput. Sci. 355(3): 354-363 (2006) |
| 2004 |
|---|
| 1 | EE | Zemin Jin,
Xueliang Li:
The complexity for partitioning graphs by monochromatic trees, cycles and paths.
Int. J. Comput. Math. 81(11): 1357-1362 (2004) |
