| 2009 |
|---|
| 10 | EE | Jiansheng Cai,
Guizhen Liu,
Jianfeng Hou:
The stability number and connected [k, k+1]-factor in graphs.
Appl. Math. Lett. 22(6): 927-931 (2009) |
| 9 | EE | Jianfeng Hou,
Guizhen Liu,
Jiansheng Cai:
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles.
Discrete Mathematics 309(1): 77-84 (2009) |
| 2008 |
|---|
| 8 | EE | Bin Liu,
Jianfeng Hou,
Guizhen Liu:
List edge and list total colorings of planar graphs without short cycles.
Inf. Process. Lett. 108(6): 347-351 (2008) |
| 7 | EE | Jiansheng Cai,
Guizhen Liu,
Jianfeng Hou:
Binding number and Hamiltonian (g, f)-factors in graphs II.
Int. J. Comput. Math. 85(9): 1325-1331 (2008) |
| 2007 |
|---|
| 6 | EE | Jiansheng Cai,
Guizhen Liu,
Jianfeng Hou:
Binding Number and Connected ( g , f + 1)-Factors in Graphs.
International Conference on Computational Science (3) 2007: 313-319 |
| 5 | EE | Jianfeng Hou,
Guizhen Liu,
Jianliang Wu:
Some Results on List Total Colorings of Planar Graphs.
International Conference on Computational Science (3) 2007: 320-328 |
| 4 | EE | Jihui Wang,
Sumei Zhang,
Jianfeng Hou:
On f -Edge Cover-Coloring of Simple Graphs.
International Conference on Computational Science (3) 2007: 448-452 |
| 3 | EE | Guizhen Liu,
Jianfeng Hou,
Jiansheng Cai:
Some results about f-critical graphs.
Networks 50(3): 197-202 (2007) |
| 2 | EE | Jianliang Wu,
Jianfeng Hou,
Guizhen Liu:
The linear arboricity of planar graphs with no short cycles.
Theor. Comput. Sci. 381(1-3): 230-233 (2007) |
| 2006 |
|---|
| 1 | EE | Jianfeng Hou,
Guizhen Liu,
Jiansheng Cai:
List edge and list total colorings of planar graphs without 4-cycles.
Theor. Comput. Sci. 369(1-3): 250-255 (2006) |
