学校首页 图书馆(日照校区) 旧版首页





梁作松,上海大学运筹学与控制论专业获博士学位,副教授,曲阜师范大学杏坛学者。

   主要从事组合最优化与图论研究。在国际核心期刊《Journal of Combinatorial Optimization》《Operations Research Letters》《European Journal of Combinatorics》《 Discrete Math等发表论文20余篇。主持国家自然科学基金2项、省部级项目2项。联系方式:山东省日照市, 曲阜师范大学管理学院, 276800

电子邮件:liangzuosong@126.com

教育情况:

2000.92004.7,曲阜师范大学数学系,数学教育,获学士学位

2007.92010.7,上海大学数学系,运筹学,获硕士学位

2007.92010.7,上海大学数学系,运筹学,获博士学位

工作经历:

2013.7—2017.12, 曲阜师范大学,讲师

2018.1—至今, 曲阜师范大学,副教授

研究方向: 运筹学

荣誉称号:

2018年度入选曲阜师范大学杏坛学者

学术交流:

2019.3—2012.12,山东大学数学学院,访问学者。

项目基金:

2017.12019.12,图的团染色及其相关算法研究, 国家自然科学青年基金, 19万,主持.

2015.1-2015.12,图的团横贯与团独立集,国家自然科学基金天元基金,3万,主持.

主要学术论著:

  1. Zuosong Liang, Total-coloring of claw-free planar graphs, Discussiones Mathematicae Graph Theory, 2020+, doi:10.7151/dmgt.2300.

  2. Zuosong Liang, Jianliang Wu, Erfang Shan, List-coloring clique- hypergraphs of K5-minor-free graphs strongly, Discrete Math, (343) 2020,111777.

  3. Zuosong Liang, Erfang Shan, Liying Kang, The clique-perfectness and clique-coloring of outer-planar graphs Journal of Combinatorial Optimization(38) 2019, 794-807.

  4. Zuosong Liang, Erfang Shan, Huiyu Xing, Chunsong Bai, A linear-time algorithm for clique-coloring planar graphsOperations Research Letters (47) 2019, 241-243.

  5. Zuosong Liang, Erfang Shan, Yuzhong Zhang, A linear-time algorithm for clique-coloring problem in circular-arc graphs, Journal of Combinatorial Optimization (33) 2017, 147-155.

  6. Zuosong Liang, Erfang Shan, The clique-transversal set problem in {claw, K-4}-free planar graphsInformation Processing Letters(118) 2017, 64-68.

  7. Zuosong Liang, Erfang Shan, Liying Kang, Clique-Perfectness of Claw-Free Planar Graphs Graphs and Combinatorics, (32) 2016, 2551-2562.

  8. Zuosong Liang, Erfang Shan, Liying Kang, Clique-coloring claw-free graphs, Graphs and Combinatorics, (32)2016 1473-1488.

  9. Erfang Shan, Zuosong Liang, Liying Kang, Clique-transversal sets and clique-coloring in planar graphs, European Journal of Combinatorics, (36) 2014367-376.

  10. Zuosong Liang, Erfang Shan, The clique-transversal set problem in claw-free graphs with degree at most 4, Information Processing Letters,(1152015331-335.

  11. Zuosong Liang, Erfang Shan, Approximation algorithms for clique-transversals and clique-independent sets in cubic graphs, Information Processing Letters(111) 2011,1104-1107

  12. Erfang Shan, Zuosong Liang, Clique-transversal number in cubic graphs, Discrete Mathematics & Theoretical Computer Science, (10)2008, 115-123.