当前位置: X-MOL首页全球导师 国内导师 › 崔庆

个人简介

崔庆,南京航空航天大学数学系副教授,硕士生导师。2009年博士毕业于南开大学组合数学中心,导师为郁星星教授;2017年在美国佐治亚州立大学访学1年,合作导师为陈冠涛教授。主要研究方向为结构图论,先后主持完成国家自然科学基金青年科学基金项目1项、中国博士后科学基金面上项目1项、江苏省博士后基金1项、南京航空航天大学基本科研业务费2项(理工融合专项基金以及青年科技创新基金),现主持国家自然科学基金面上项目1项。目前在Journal of Combinatorial Theory, Series B、Journal of Graph Theory、SIAM Journal on Discrete Mathematics、European Journal of Combinatorics等期刊上发表学术论文20余篇。 教育经历 2004.9 -- 2009.6南开大学 应用数学 博士研究生毕业 理学博士学位 2000.9 -- 2004.7山东大学 信息与计算科学 大学本科毕业 理学学士学位 工作经历 2016.12 -- 2018.1美国佐治亚州立大学数学与统计学系 访问学者 2011.5 -- 至今南京航空航天大学理学院数学系 副教授 2009.6 -- 2011.5南京航空航天大学理学院数学系 讲师

研究领域

[1] 图论及其应用 [2] 组合最优化

图论及其应用、组合最优化

近期论文

查看导师新发文章 (温馨提示:请注意重名现象,建议点开原文通过作者单位确认)

1. Hamilton circles in infinite planar graphs (with Jian Wang and Xingxing Yu), Journal of Combinatorial Theory, Series B, 99 (2009) 110-138. 2. Long cycles in 4-connected planar graphs (with Yumei Hu and Jian Wang), Discrete Mathematics, 309 (2009) 1051-1059. 3. Maximum bipartite subgraphs of cubic triangle-free planar graphs (with Jian Wang), Discrete Mathematics, 309 (2009) 1091-1111. 4. Packing and covering triangles in planar graphs (with Penny Haxell and Will Ma), Graphs and Combinatorics, 25 (2009) 817-824. 5. A note on circuit graphs, The Electronic Journal of Combinatorics, 17 (2010) #N10. 6. On degrees of vertices in critically k-connected graphs (with Lingping Zhong), Acta Mathematicae Applicatae Sinica (Chinese Series), 35 (2012) 928-934. 7. A note on circumferences in k-connected graphs with given independence number (with Lingping Zhong), Ars Combinatoria, 111 (2013) 315-322. 8. Spanning trees in subcubic graphs (with Rui Li), Ars Combinatoria, 117 (2014) 411-415. 9. On a relation between the atom-bond connectivity and the first geometric-arithmetic indices (with Lingping Zhong), Discrete Applied Mathematics, 185 (2015) 249-253. 10. The harmonic index for unicyclic graphs with given girth (with Lingping Zhong), Filomat, 29 (2015) 673-686. 11. The maximum atom-bond connectivity index for graphs with edge-connectivity one (with Qiuping Qian and Lingping Zhong), Discrete Applied Mathematics, 220 (2017) 170-173. 12. On the general sum-connectivity index of trees with given number of pendent vertices (with Lingping Zhong), Discrete Applied Mathematics, 222 (2017) 213-221. 13. The general Randić index of trees with given number of pendent vertices (with Lingping Zhong), Applied Mathematics and Computation, 302 (2017) 111-121. 14. On the harmonic index and the average eccentricity of graphs (with Lingping Zhong), Utilitas Mathematica, 103 (2017) 311-318. 15. 2-bisections in claw-free cubic multigraphs (with Qinghai Liu), Discrete Applied Mathematics, 257 (2019) 325-330. 16. The chromatic number of graphs with no induced subdivision of K_4 (with Guantao Chen, Yuan Chen, Xing Feng and Qinghai Liu), Graphs and Combinatorics, 36 (2020) 719-728. 17. On even cycle decompositions of line graphs of cubic graphs (with Wenzhong Liu and Huazheng You), Discrete Mathematics, 343 (2020) 111904. 18. A note on 3-bisections in subcubic graphs (with Wenzhong Liu), Discrete Applied Mathematics, 285 (2020) 147-152. 19. Partitioning claw-free subcubic graphs into two dominating sets, Graphs and Combinatorics, 36 (2020) 1723-1740. 20. A characterization of nonfeasible sets in matching covered graphs (with Qinghai Liu, Xing Feng and Fuliang Lu), Journal of Graph Theory, 95 (2020) 509-526. 21. The chromatic number of {ISK_4, diamond, bowtie}-free graphs (with Guantao Chen, Yuan Chen, Xing Feng and Qinghai Liu), Journal of Graph Theory, 96 (2021) 554-577. 22. Implications in rainbow forbidden subgraphs (with Qinghai Liu, Colton Magnant and Akira Saito), Discrete Mathematics, 344 (2021) 112267. 23. Strongly even cycle decomposable 4-regular line graphs (with Wenzhong Liu, Jiancheng Wang and Yan Yang), European Journal of Combinatorics, 94 (2021) 103315. 24. Tight gaps in the cycle spectrum of 3-connected planar graphs (with On-Hei Solomon Lo), SIAM Journal on Discrete Mathematics, 35 (2021) 2039-2048. 25. List star edge-coloring of claw-free subcubic multigraphs (with Zhenmeng Han), Discrete Applied Mathematics, 309 (2022) 258-264. 26. On 4-connected 4-regular graphs without even cycle decompositions (with Wenzhong Liu and Yunzhuo Wang), submitted. [1] 崔庆,韩珍蒙.List star edge-coloring of claw-free subcubic multigraphs.Discrete Applied Mathematics,2022,309:258-264 [2] 崔庆,卢安晞.Tight gaps in the cycle spectrum of 3-connected planar graphs.SIAM Journal on Discrete Mathematics,2021,35(3):2039-2048 [3] 刘文忠,王建程,崔庆等.Strongly even cycle decomposable 4-regular line graphs.European Journal of Combinatorics,2021,94:103315 [4] 崔庆,刘清海,Colton Magnant等.Implications in rainbow forbidden subgraphs.Discrete Mathematics,2021,344(4):112267 [5] 陈冠涛,陈园,崔庆等.The chromatic number of {ISK_4, diamond, bowtie}-free graphs.Journal of Graph Theory,2021,96(4):554-577 [6] 刘清海,崔庆,冯星等.A characterization of nonfeasible sets in matching covered graphs.Journal of Graph Theory,2020,95(4):509-526 [7] 崔庆.Partitioning claw-free subcubic graphs into two dominating sets.Graphs and Combinatorics,2020,36(6):1723-1740 [8] 崔庆,刘文忠.A note on 3-bisections in subcubic graphs.Discrete Applied Mathematics,2020,285:147-152 [9] 刘文忠,游华峥,崔庆.On even cycle decompositions of line graphs of cubic graphs.Discrete Mathematics,2020,343(7):111904 [10] 陈冠涛,陈园,崔庆等.The chromatic number of graphs with no induced subdivision of K_4.Graphs and Combinatorics,2020,36(3):719-728 [11] 崔庆,刘清海.2-bisections in claw-free cubic multigraphs.Discrete Applied Mathematics,2019,257:325-330 [12] 钟玲平,崔庆.On the harmonic index and the average eccentricity of graphs.Utilitas Mathematica,2017,103:311-318 [13] 崔庆,钟玲平.The general Randić index of trees with given number of pendent vertices.Applied Mathematics and Computation,2017,302:111-121 [14] 崔庆,钟玲平.On the general sum-connectivity index of trees with given number of pendent vertices.Discrete Applied Mathematics,2017,222:213-221 [15] 崔庆,钱秋平,钟玲平.The maximum atom-bond connectivity index for graphs with edge-connectivity one.Discrete Applied Mathematics,2017,220:170-173

学术兼职

2009.10 -- 至今《Mathematical Reviews》评论员

推荐链接
down
wechat
bug