姓名:黄明芳

性别:女

出生年月:1975年09月

职称/职务:副教授

学位/学历:博士/研究生

硕/博生导师:硕导

联系方式:ds_hmf@126.com

研究方向:图论

教育背景与工作经历:

2009.09–2013.06，华中师范大学，基础数学，理学博士

2000.09–2003.06，华中科技大学，计算机软件与理论，工学硕士

1994.09–1998.07，华中师范大学，数学教育，理学学士

1998.07-今，武汉理工大学，必发365，副教授、硕士生导师

主要教学科研成果:

1.  Yang Xiao, Mingfang Huang*, A weak DP-coloring of planar graphs without 4- and 9-cycles, Discrete Applied Mathematics, 2024, 342: 391-397

2.  Mingfang Huang#, Guorong Liu, Xiangqian Zhou, Strong list-chromatic index of planar graphs with Ore-degree at most seven, Graphs and Combinatorics, 2023, 39, 116

3.  LiLy Chen, Mingfang Huang, Gexin Yu, Xiangqian Zhou, The strong edge-coloring for graphs with small  edge weight, Discrete Mathematics, 2020,343(4)

4.  Mingfang Huang#，Michael Santana, Gexin Yu, Strong chromatic index of graphs with maximum degree four, Electronic Journal of Combinatorics, 2018,25(3):P3.31

5.  Mingfang Huang#, Gexin Yu, Xiangqian Zhou*, The strong chromatic index of (3, △)-bipartite graphs, Discrete Mathematics, 2017, 340(5):1143~1149

6.  Mingfang Huang#，Xiangwen Li, Group connectivity and matchings, Graphs and Combinatorics, 2015, 31(4): 993~1001

7.  Mingfang Huang*，Xiangwen Li, Maximum degree of 3-independent vertices and group connectivity, Ars Combinatoria, 2015, 123: 3~16

8.  Mingfang Huang#，Xiangwen Li, A note on Z(5)-connectivity in 3-edge-connected graphs, Ars Combinatoria, 2014, 113: 241~255

主要科研项目:

1.      2018-2022. 图的瑕疵染色与群连通度的若干问题

2.      2022-2026. 图的顶点划分若干问题