图论及其应用

工作经历：
2023.10--至今，      兰州大学数学与统计学院，副教授；
2016.7  --2023.10，兰州大学数学与统计学院，讲师；

教育背景：
2012.9-2016.6：山东大学数学学院，理学博士，导师为吴建良教授；
2014.8-2015.12：美国佐治亚州立大学数学与统计系，国家公派联合培养博士生，导师为陈冠涛教授；
2009.9-2012.6：西北师范大学数学与统计学院，理学硕士，导师为陈祥恩教授；
2005.9-2009.6：西北师范大学数学与统计学院，理学学士

讲授的课程：高等数学、线性代数、图论

[1]Guantao Chen, Yuping Gao, Ringi Kim, Luke Postle, Songling Shan. Chromatic index determined by fractional chromatic index. J. Combinatorial Theory, Series B, 2018, 131: 85-108. 
[2]Xiaowei Yu, Yuping Gao, Laihao Ding. Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz. Acta Mathematicae Applicatae Sinica, 2018, 34 (1): 135-144.
[3]Guantao Chen, Yuping Gao, Songling Shan, Guanghui Wang, Jianliang Wu. Equitable vertex arboricity of 5-degenerate graphs. J. Combinatorial Optimization, 2017, 34: 426-432.
[4]Yuping Gao, Guanghui Wang, Jianliang Wu. Neighbor sum distinguishing edge colorings of graphs with small maximum average degree. Bulletin of the Malaysian Mathematical Sciences Society, 2016, 39: S247-S256.
[5]Yuping Gao, Guanghui Wang, Jianliang Wu. A relaxed case on 1-2-3 Conjecture. Graphs and Combinatorics. 2016, 32: 1415-1421.
[6]Xiang’en Chen, Yuping Gao, Bing Yao. Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph. Information Sciences, 2014, 288: 246-253.
[7]Xiang’en Chen, Yuping Gao, Bing Yao. Vertex-distinguishing IE-total colorings of complete bipartite graphs Km,n(m<n). Discussiones Mathematicae Graph Theory, 2013, 33(2): 289-306.
[8]Xiang’en Chen, Yuping Gao, Bing Yao. Not necessarily proper total colourings which are adjacent vertex distinguishing. International Journal of Computer Mathematics, 2013, 90(11): 2298-2307.

主持一项中央高校基金，研究期限：2017.1-2018.12，项目号：lzujbky-2017-28。