侯建锋
 
基本信息
职称 教授
职务 博士生导师
主讲课程
研究方向 图论及其应用
办公室 数计学院2号楼208
电子邮件
联系电话 22866352
个人简介

个人简介:

侯建锋,男,1981年生,教授,博士生导师,福州大学“旗山学者”,现为数学与计算机科学学院副院长。2009年7月毕业于山东大学数学学院,获理学博士学位。2011年度全国优秀博士学位论文提名奖,2011年度福建省自然科学基金杰出青年项目获得者,主要从事图论及其应用研究,发表论文50余篇。美国数学评论“MathematicalReview”评论员。

教育及工作经历:

2017/08-,福州大学数学与计算机科学学院,教授

2012/07-2017/07,福州大学数学与计算机科学学院,副教授

2014/09-2015/09,美国佐治亚理工学院,访问学者

2013/03-2013/05,中国科学院数学与系统科学学院,访问学者

2009/07-2012/07,福州大学数学与计算机科学学院,讲师

2004/09-2009/07,山东大学数学学院(硕博连读),获博士学位

2000/09-2004/07,山东大学数学学院,获学士学位

科研项目:

1. 国家自然科学基金面上项目,11671087,图与超图若干划分问题的研究,2017/01-2020/1257.2万,主持

2. 国家自然科学基金重点项目,11331003,网络设计中的离散数学方法,2014/01-2018/12240万,参加

3. 国家自然科学基金青年项目,11001055,几类图染色问题的研究,2011/01-2013/1217万,主持

4福建省自然科学基金杰青项目,2011J06001图的无圈染色和无圈列表染色的研究, 2011/04-2014/0420万,主持

5.福建省自然科学基金青年项目2010J05004图上几类染色问题的研究, 2010/05-2012/053万,主持

6.国家自然科学基金面上项目图的(t,k,d-树染色问题的研究,10971121 2010/01-2012/1224万,参加

7. 福建省高校杰出青年科研人才培育计划,几类图染色问题的研究2011/04-2014/044.5万,主持

8. 福建省高等学校新世纪优秀人才支持计划,图的路分解和Gallai猜想的研究,2014/01-2016/125万, 主持

获奖情况:

2013年度第二届福州大学杰出青年教师励志奖获得者

2011年全国优秀博士学位论文提名奖

2011年福建省自然科学基金杰青项目获得者

2010年山东省优秀博士学位论文

2010年山东大学优秀博士学位论文

学术任职:

中国运筹学会图论组合学分会青年理事

中国工业与应用数学学会图论组合及应用专业委员会委员

International Journal of Mathematics and StatisticsEditor

International Journal of Applied Mathematics and StatisticsEditor

主要论著:

1. Genghua Fan, Jianfeng Hou, Xingxing Yu, Bisections of graphs without short cycles, Combinatorics, Probability and Computing, to appear. (SCI)

2. Shufei Wu, Jianfeng Hou, Partitioning dense uniform hypergraphs, J. Combin. Optim., DOI 10.1007/s10878-017-0153-x (SCI)

3. Genghua Fan, Jianfeng Hou, Bounds for pairs in judicious partitioning of graphs, Random Structures Algorithms 50 (2017) 59–70. (SCI)

4. Jianfeng Hou, Qinghou Zeng, Judicious partitioning of hypergraphs with edges of size at most 2, Combinatorics, Probability and Computing  26 (2017) 267-284. (SCI)

5. Jianfeng Hou, Qinghou Zeng, On a problem of judicious k-partitions of graphs, J. Graph Theory 85 (2017) 619–643. (SCI)

6. Jianfeng Hou, Shufei Wu, On bisections of directed graphs, European Journal of Combinatorics 63 (2017) 44-58.  (SCI)

7. Qinghou Zeng, Jianfeng Hou, Jin Deng, Xia Lei, Biased partitions and judicious k-partitions of graphs, Acta Mathematica Sinica, English Series, 33 (2017) 668–680. (SCI)

8. Qinghou Zeng, Jianfeng Hou, Bipartite subgraphs of H-free graphs, Bull. Aust. Math. Soc. 96 (2017) 1-13. (SCI)

9. Xia Zhang, Jianfeng Hou, Guizhen Liu, Guiying Yan, Graphs of f -class 1, Discrete Applied Mathematics 222 (2017) 197-204. (SCI)

10. Qinghou Zeng, Jianfeng Hou, Bounds for the number of meeting edges in graph partitioning, Czechoslovak Mathematical Journal, 67 (2017) 741–752. (SCI)

11. Lei Cheng, Jianfeng Hou, Yusheng Li, Qizhong Lin, Monochromatic solutions for multi-term unknowns, Graphs and Combinatorics  32 (2016) 2275–2293. (SCI)

12. Jianfeng Hou, Shufei Wu, Guiying Yan, On judicious partitions of uniform hypergraphsJournal of Combinatorial Theory, Series A 141 (2016) 16-32. (SCI)

13. Jianfeng Hou, Shufei Wu, Acyclic coloring of graphs without bichromatic long path, Front. Math. China 10 (2015)  1343–1354.  (SCI)

14.  Xin Zhang, Jianfeng Hou, Guizhen Liu, On total colorings of 1-planar graphs, J. Comb. Optim. 30 (2015)  160–173. (SCI)

15.  Genghua Fan, Jianfeng Hou, Qinghou Zeng, A bound for judicious k-partitions of graphs, Discrete Appl. Math. 179 (2014) 86–99. (SCI) 

16. Jianfeng Hou, G. Liu, Every toroidal graph is acyclically 8-choosable, Acta Mathematica Sinica, English Series, 30 (2014) 343–352.  (SCI)

17. Jianfeng Hou, Weitao Wang, Xiaoran Zhang, Acyclic edge coloring of planar graphs with girth at least 5, Discrete Appl. Math. 161 (2013) 2958–2967. (SCI)

18.  Yue Guan, Jianfeng Hou, Yingyuan Yang, An improved bound on acyclic chromatic index of planar graphs, Discrete Math. 313 (2013) 1098–1103.  (SCI)

19.  Q. Lin, Jianfeng Hou, Y. Liu, Acyclic edge coloring of graphs with large girths, Science China Mathematics, 12 (2012) 2593–2600.  (SCI)

20. M. Cygan, Jianfeng Hou, Ł. Kowalik, B. Luvzar, J. Wu, A planar linear arboricity conjecture, Journal of Graph Theory, 69 (2012), 403–425, 2012 (SCI)

21.  Jianfeng Hou, G. Liu, J. Wu, Acyclic edge coloring of planar graphs without small cycles, Graphs and Combinatorics, 28 (2012) 215–226 (SCI)

22.  Jianfeng Hou, B. Liu, G. Liu, J. Wu, Total coloring of planar graphs without 6-cycles, Discrete Applied Mathematics 159 (2011) 157-163. (SCI)

23. Jianfeng Hou, G. Liu, G. Wang, Improved bounds for acyclic chromatic index of planar graphs, Discrete Applied Mathematics 159 (2011) 876-881. (SCI)

24.  G. Chang, Jianfeng Hou, N. Roussel, Local condition for planar graphs of maximum degree 7 to be 8-totally colorable, Discrete Applied Mathematics 159 (2011) 760-768. (SCI)

25. Jianfeng Hou, N. Roussel, J. Wu, Acyclic chromatic index of planar graphs with triangles, Information Processing Letters, 111 (2011) 836-840. (SCI)

26.  Jianfeng Hou, G. Liu, J. Wu, Bondage number of planar graphs without small cycles, Utilitas Mathematica, 84 (2011) 189-199. (SCI)

27. Jianfeng Hou, J. Wu, G. Liu, B. Liu, Acyclic edge chromatic number of outerplanar graphs, J. Graph Theory, 64 (2010) 22-36. (SCI)

28. Jianfeng Hou, J. Wu, G. Liu, B. Liu, Total coloring of embedded graphs of maximum degree at least ten: Science China-Mathematics, 53 (2010) 2127-2133. (SCI)

29. Jianfeng Hou, B. Liu, G. Liu, J. Wu, Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles, International Journal of Computer Mathematics, 87 (2010) 2880-2886. (SCI)

30. G. Chang, Jianfeng Hou, N. Roussel, On the total choosability of planar graphs and of sparse graphs, Information Processing Letters, 110 (2010) 849-853. (SCI)

31. G. Liu, Jianfeng Hou, The method of coloring in graphs and its application, J. Systems Science & Complexity, 23 (2010) 951-960. (SCI)

32. X. Zhang, G. Liu Guizhen, J. Cai, Jianfeng Hou, A new sufficient condition for graphs of f-class 1, Ars Combinatoria, 97 (2010) 403-412. (SCI)

33. Jianfeng Hou, J. Wu, G. Liu, B. Liu, Acyclic edge colorings of planar graphs and series-parallel graphs, Science in China Series A: Mathematics, (2009) 52 (3) 1-12. (SCI)

34. Jianfeng Hou, G. Liu, J. Cai, Edge-choosability of planar graphs without adjacent triangles or without 7-cycles, Discrete Math., 309(2009) 77-84. (SCI)

35. Jianfeng Hou, G. Liu, J. Wu, On 3-degeneracy of some C7-free plane graphs with application to choosability. Ars Combin., 91 (2009) 289–296. (SCI)

36. Jianfeng Hou, G. Liu, Some Results on Edge Coloring Problems with Constraints in Graphs, The Eighth International Symposium on Operations Research and Its Applications (ISORA’09), Zhangjiajie, China, September 20–22, (2009) ORSC & APORC, pp. 6–14. (ISTP)

37. B. Liu, Jianfeng Hou, J. Wu, G. Liu, Total colorings and list total colorings of planar graphs without intersecting 4-cycles, Discrete Mathematics, 309 (2009) 6035-6043. (SCI)

38. D. Yu, Jianfeng Hou, G. Liu, B. Liu, L. Xu, Acyclic edge coloring of planar graphs with large girth, Theoretical Computer Science, 410 (2009) 5196-5200. (SCI)

39. X. Sun, J. Wu, Y. Wu, Jianfeng Hou, Total colorings of planar graphs without adjacent triangles. Discrete Math. 309 (2009), no. 1, 202-206. (SCI)

40. J. Cai, G. Liu, Jianfeng Hou, The stability number and connected [k,k+1]-factor in graphs, Appl. Math. Lett., 22 (2009), 927-931. (SCI)

41. J. Cai, Jianfeng Hou, X. Zhang, G. Liu, Edge-choosability of planar graphs without non-induced 5-cycles. Inform. Process. Lett., 109 (2009) 343-346. (SCI)

42.  侯建锋, 吴建良, 刘桂真, 刘彬, 平面图和系列平行图的无圈边染色, 中国科学A: 数学, 38 (12) (2008) 1335-1346.

43. Jianfeng Hou, Y. Zhu, G. Liu, J. Wu, Total colorings of planar graphs without small cycles. Graphs and Combinatorics, 24 (2008) 91–100. (SCI)

44. Jianfeng Hou,G. Liu, Y. Xin, M. Lan, Some results on total colorings of planar graphs, J. Appl. Math. & Informatics, 26 (2008), 511-517.

45. B. Liu, Jianfeng Hou, G. Liu, List edge and list total colorings of planar graphs without short cycles, Information Processing Letters, 108 (2008) 347–351. (SCI)

46. Jianfeng Hou, G. Liu, J. Wu, Some Results on List Total Colorings of Planar Graphs, Lecture Note in Computer Science, 4489 (2007) 320-328. (EI,ISTP)

47.  G. Liu, Jianfeng Hou, J. Cai, Some results about f-critical graphs, Networks, 50 (3)(2007) 197-202. (SCI)

48. J. Wu, Jianfeng Hou, G. Liu, The linear arboricity of planar graphs with no short cycles, Theoretical Computer Science, 381 (2007) 230-233. (SCI)

49. J. Wang, Hou Jianfeng, G. Liu, Some properties on f-edge covered critical graphs, J. Appl. Math. & Computing, 24 (2007), 357-366.(EI)

50. Jianfeng Hou, G. Liu, J. Cai, List edge and list total colorings of planar graphs without 4-cycles, Theoretical Computer Science, 369 (2006) 250-255. (SCI)

学生培养:

毕业博士研究生:毋述斐

毕业硕士研究生:杨威,王炜涛,杨英媛,管悦,吕春琼,程磊,曾庆厚,宋辉,邓瑾

在读硕士研究生:王燕秋,林晨龙,李哲,耿精玉,巫鹏,柴宏亮

在读博士生:龚志伟,马化文,朱洪国