卢福良

作者: 时间:2026-05-30 点击数:

研究领域(方向)

图论及其应用

个人简历

2004年本科毕业于重庆大学,硕士(2007年)、博士(2011年)毕业于厦门大学,2011年8月-2019年5月在临沂大学任教,2019年6月至今在OK138太阳集团任教。2020 年入选省“闽江学者”特聘教授,2021年入选省“雏鹰计划”青年拔尖人才, 2021年入选省百千万人才工程人选。

科研项目

主持国家自然科学基金面上项目1项,省重点项目1项,主持完成国家自然科学基金面上项目1项,省自然科学基金杰青项目等3项。

近期代表作

[1] Xiaoling He, Fuliang Lu*, Jinxin Xue, Wheel-like bricks and minimal matching covered graphs, Journal of Graph Theory, (2026); 111:5–16.

[2] Yipei Zhang, Fuliang Lu*, Xiumei Wang, Jinjiang Yuan, Removable edges in near-bipartite bricks, Journal of Graph Theory, 108(1), (2025), 113–135.

[3] Xiaoling He, Fuliang Lu*, Thin edges in the subgraph induced by noncubic vertices of a brace, Discrete Applied Mathematics, 364(2025), 153–156.

[4] Fuliang Lu*, Huali Pan, The number of perfect matchings in a brick, Discrete Mathematics, 348 (2025) 114365.

[5] Fuliang Lu, Jianguo Qian*, Independent removable edges in cubic bricks, The Electronic Journal of Combinatorics, 32(1) (2025), #P1.19.

[6] Wuxian Chen, Fuliang Lu, Heping Zhang*, Nice vertices in cubic graphs, Discrete Mathematics, 348 (2025) 114553.

[7] Jinxin Xue, Fuliang Lu*, Thin edges in claw-free bricks, The Electronic Journal of Combinatorics, 32(3) (2025), #P3.17.

[8] Xiaoling He, Fuliang Lu*, Thin edges in cubic braces, Journal of Graph Theory, 107(3) (2024), 642–675.

[9] Xiaoling He, Fuliang Lu*, The cubic vertices of solid minimal bricks, Discrete Mathematics, 347(2024) 113746.

[10] Yan Wang, Jiahong Deng, Fuliang Lu*, Removable edges in Halin graphs, Discrete Applied Mathematics, 349 (2024) 1–7.

[11] Xiaoxia Wu, Fuliang Lu*, Lianzhu Zhang, Removable Edges in Claw-Free Bricks, Graphs and Combinatorics, (2024) 40:43.

[12] Guantao Chen, Xing Feng, Fuliang Lu, C. L. Lucchesi, Lianzhu Zhang, Laminar tight cuts in matching covered graphs, Journal of Combinatorial Theory, Series B, 150(2021), 177–194.

[13] Xing Feng, Fuliang Lu*, On extremal nonsolid bricks, Journal of Graph Theory, 97(2)(2021), 189–193.

[14] Qinghai Liu, Qing Cui, Xing Feng, Fuliang Lu*, A characterization of non-feasible sets in matching covered graphs, Journal of Graph Theory, 95(4)(2020), 509–526.

联系方式

电子邮箱:flianglu@163.com

联系地址:福建省漳州市芗城区县前直街36号ok138cn太阳集团


Copyright ©中国·ok138cn太阳集团(有限公司)官方网站-Official website 版权所有  电话:0596-2591441 传真:0596-2527931  学院党委信箱:msdstydzzh@163.com