姓名：杨晓静

职称：讲师

办公室：501

邮箱：yangxiaojing89@163.com

研究领域：图论

教育背景：

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

工作经历：

2020-07 至今, WilliamHill中文官方网站,  讲师

代表性学术论文：

[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万元.