Jianfeng Hou

Yue Guan, Jianfeng Hou, Yingyuan Yang: An improved bound on acyclic chromatic index of planar graphs. Discrete Mathematics 313(10): 1098-1103 (2013)

Xin Zhang, Jianfeng Hou, Guizhen Liu: On total colorings of 1-planar graphs. CoRR abs/1304.6263 (2013)

Jianfeng Hou, Guizhen Liu: A Bound on the bondage Number of toroidal Graphs. Discrete Math., Alg. and Appl. 4(3) (2012)

Jianfeng Hou, Guizhen Liu, Jianliang Wu: Acyclic Edge Coloring of Planar Graphs Without Small Cycles. Graphs and Combinatorics 28(2): 215-226 (2012)

Jianfeng Hou: Acyclic edge coloring of sparse graphs. CoRR abs/1202.6129 (2012)

Yue Guan, Jianfeng Hou, Yingyuan Yang: An improved bound on acyclic chromatic index of planar graphs. CoRR abs/1203.5186 (2012)

Jianfeng Hou, Bin Liu, Guizhen Liu, Jianliang Wu: Total coloring of planar graphs without 6-cycles. Discrete Applied Mathematics 159(2-3): 157-163 (2011)

Gerard Jennhwa Chang, Jianfeng Hou, Nicolas Roussel: Local condition for planar graphs of maximum degree 7 to be 8-totally colorable. Discrete Applied Mathematics 159(8): 760-768 (2011)

Jianfeng Hou, Guizhen Liu, Guanghui Wang: Improved bounds for acyclic chromatic index of planar graphs. Discrete Applied Mathematics 159(8): 876-881 (2011)

Jianfeng Hou, Nicolas Roussel, Jianliang Wu: Acyclic chromatic index of planar graphs with triangles. Inf. Process. Lett. 111(17): 836-840 (2011)

Jianfeng Hou, Bin Liu, Guizhen Liu, Jihui Wang: Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles. Int. J. Comput. Math. 87(13): 2880-2886 (2010)

Gerard Jennhwa Chang, Jianfeng Hou, Nicolas Roussel: On the total choosability of planar graphs and of sparse graphs. Inf. Process. Lett. 110(20): 849-853 (2010)

Jianfeng Hou, Jianliang Wu, Guizhen Liu, Bin Liu: Acyclic edge chromatic number of outerplanar graphs. Journal of Graph Theory 64(1): 22-36 (2010)

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)

Jianfeng Hou, Guizhen Liu, Jianliang Wu: On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability. Ars Comb. 91 (2009)

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)

Xiang-Yong Sun, Jianliang Wu, Yu-Wen Wu, Jianfeng Hou: Total colorings of planar graphs without adjacent triangles. Discrete Mathematics 309(1): 202-206 (2009)

Bin Liu, Jianfeng Hou, Jianliang Wu, Guizhen Liu: Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discrete Mathematics 309(20): 6035-6043 (2009)

Jiansheng Cai, Jianfeng Hou, Xia Zhang, Guizhen Liu: Edge-choosability of planar graphs without non-induced 5-cycles. Inf. Process. Lett. 109(7): 343-346 (2009)

Dongxiao Yu, Jianfeng Hou, Guizhen Liu, Bin Liu, Lan Xu: Acyclic edge coloring of planar graphs with large girth. Theor. Comput. Sci. 410(47-49): 5196-5200 (2009)

Jianfeng Hou, Yan Zhu, Guizhen Liu, Jianliang Wu, Mei Lan: Total Colorings of Planar Graphs without Small Cycles. Graphs and Combinatorics 24(2): 91-100 (2008)

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)

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)

Guizhen Liu, Jianfeng Hou, Jiansheng Cai: Some results about f-critical graphs. Networks 50(3): 197-202 (2007)

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)

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

Jianfeng Hou, Guizhen Liu, Jianliang Wu: Some Results on List Total Colorings of Planar Graphs. International Conference on Computational Science (3) 2007: 320-328

Jihui Wang, Sumei Zhang, Jianfeng Hou: On f -Edge Cover-Coloring of Simple Graphs. International Conference on Computational Science (3) 2007: 448-452

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)