杨晓静-太阳成集团tyc151cc

姓名：杨晓静

职称：讲师

办公室：501

邮箱：yangxiaojing89@163.com

研究领域：图论

教育背景：

2016.09-2020.07:  博士 北京理工大学  应用数学专业

工作经历：

2020-07 至今, 河南大学,  讲师

代表性学术论文：

[1].xia liu; zdeněk ryjáček; petr vrána; liming xiong; xiaojing yang; hamilton-connected {claw,net}-free graphs, ii, journal of graph theory, 2023, 103: 119-138.      (期刊论文)

[2].xia liu; zdeněk ryjáček; petr vrána; liming xiong; xiaojing yang; hamilton-connected {claw, net}-free graphs, i, journal of graph theory, 2023, 102: 154-179.      (期刊论文)

[3].xiaojing yang; liming xiong; forbidden subgraphs for existences of (connected) 2-factor of a graph, discussiones mathematicae graph theory, 2023, 43: 211-224.      (期刊论文)

[4]xiaojing yang; liming xiong; hamiltonian extendable graphs, discussiones mathematicae graph theory, 2022, 42: 843-859.      (期刊论文)

[5].xiaojing yang; junfeng du; liming xiong; forbidden subgraphs for supereulerian and hamiltonian graphs, discrete applied mathematics, 2021, 288: 192-200.      (期刊论文)

[6]. xiaojing yang; liming xiong ; forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian, quaestiones mathematicae, 2021, 44(7): 857-867.      (期刊论文)

[7].xiaojing yang; liming xiong; forbidden subgraphs for a graph to have a hamiltonian path square, graphs and combinatorics, 2020, 36(5): 1445-1456.      (期刊论文)

[8]. zhihao hui; junfeng du; shipeng wang; liming xiong; xiaojing yang; forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3, discrete mathematics, 2020, 343: 111694.      (期刊论文)

[9].xiaojing yang, baoyindoureng wu,  [1,2]-domination in graphs, discrete applied mathematics, 2014, 175:79-86. (期刊论文)

科研项目/课题:

(1) 国家自然科学基金委员会，青年科学基金项目，12101187，禁用子图与图的哈密尔顿性的相关问题研究，2022-01-01至2024-12-31，30万元，在研，主持.

(2) 河南省2021年博士后科研基金, 禁用子图条件下图的泛圈性和弦泛圈性的研究, 5万元.