王光辉

  • 王光辉

1979年11月生;教授,博士生导师。

  • 学术经历

  • 2015.12—,山东大学数学学院,教授
  • 2009.12—2015.12,山东大学数学学院,副教授
  • 2008.03—2009.09,法国中央理工学院应用数学实验室,博士后
  • 访问经历

  • 2005.11—2007.07,法国巴黎南大学信息科学实验室,博士学位
  • 2001.09—2005.10,山东大学数学学院,硕博连读
  • 1997.09—2001.07,山东大大学数学学院,学士学位
  • 项目

  • 2015—2017,山东省杰出青年基金,负责人
  • 2015—2018,图的匹配和染色,国家自然科学基金(面上基金),负责人
  • 2012—2014,图的子图和染色,国家自然科学基金(青年基金),负责人
  • 2012—2014,图与网络的结构研究,山东省优秀中青年奖励基金, 负责人
  • 2011—2012,图的彩色子图,国家自然科学基金(数学天元基金),负责人
  • 2011—2013,边染色图的结构和性质,教育部高校博士点专项基金,负责人
  • 2010—2011,图的结构和染色及其应用,山东大学自主创新基金(人才引进),负责人
  • 2010—2011,边染色图中的子图,教育部留学回国人员科研启动基金,负责人
  • 发表论著

  1. (with C. Qu, J. Wu and X. Yu) On the neighbor sum distinguishing total coloring of planar graphs, Theoretical Computer Science, 2016, 609: 162-170.
  2. (with X. Yu, J. Wu and Y. Wang) Adjacent vertex distinguishing colorings by sum of sparse graphs, Discrete Mathematics, 2016, 339(1): 62-71.
  3. (with C. Qu and G. Yan) Orthogonal matchings revisited. Discrete Mathematics, 2015, 338(11): 2080-2088.
  4. (with X. Cheng, D. Huang and J. Wu) Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ, Discrete Applied Mathematics, 2015, 190-191: 34-41.
  5. (with G. Yan) An Improved Upper Bound on Edge Weight Choosability of Graphs, Graphs and Combinatorics, 2015, 31(5): 1789-1793.
  6. (with H. Li, L. Ding and B. Liu) Neighbor sum distinguishing total colorings of planar graphs. Journal of Combinatorial Optimization, 2015, 30(3): 675-688.
  7. (with L. Ding, G. Yan) Neighbor sum distinguishing total colorings via the Combinatorial Nullstellensatz, Science China Mathematics, 2014, 55(9): 1878-1882.
  8. (with H. Li and B. Liu) Neighbor  sum distinguishing total colorings of K 4-minor free graphs Frontiers of  Mathematics in China, 2013, DOI10.1007/s11464-013-0322-x
  9. (with G. Yan, J. Yu and X. Zhang) The r-acyclic chromatic number  of planar graphs, Journal of Combinatorial  Optimization, 2013, DOI 10.1007/s10878-013-9619-7
  10. (with H. Li)Color degree and heterochromatic cycles in edge-colored graphs, European Journal of Combinatorics, 2012, 33(8): 1958-1964.
  11. (with J. Zhang and G. Liu) Existence of rainbow matchings in properly edge-colored graphs,Frontiers of mathematics in China, 7(3)(2012),543-550.
  12. (with A. Dong) Neighbor sum distinguishing coloring of some graphs, Discrete Mathematics Algorithms and Applications, 4(4)(2012),1250047.
  13. (with X. Zhang et al.) On r-acyclic edge colorings of planar graphs, Discrete Applied Mathemaitcs,160(13-14)(2012),2048-2053.
  14. (with H. Li, Y. Zhu and G. Liu) A note on heterochromatic C4 in edge-colored triangle-free graphs, Graph and Combinatorics, 28(6)(2012), 901-905
  15. (with H. Li) Color degree and Heterechromatic cycles in edge-colored graphs, European J. Comb. 33 (8)(2012), 1958-1964.
  16. (with B. Liu, G. Yu and G. Liu) Circular colorings of digraphs, Graph and Combinatorics, 28(6)(2012), 889-900.
  17. (with J. Yu and N. Wang) Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks, J. Parallel Distrib. Comput.,72(1)(2012),35-47.
  18. (with J. Hou and G. Liu) Improved bounds for acyclic chromatic index of planar graphs, Discrete Mathematics, 159 (2011), 876-881.
  19. Rainbow matchings in properly edge-colored graphs, Electronic Journal of Combinatorics, 18 (2011), #R162.
  20. (with S. Zhou, J. Wu and G. Liu) Circular vertex arboricity. Discrete Applied Mathematics 159(12): 1231-1238 (2011)
  21. (with S. Zhou and H. Li) The k-dominating cycles in graphs. Eur. J. Comb. 31(2): 608-616 (2010)
  22. (with S. Zhou and H. Li) Algorithm for two disjoint long paths in 2-connected graphs. Theor. Comput. Sci. 411(34-36)(2010), 3247-3254.
  23. (with Z. Fang et al. ) Differential gene response to oxygen availability in Kluyveromyces lactis: an insight on the evolution of oxygen responding systems from an ancestral ‘pre-WGD’ genome to a ‘post-WDG’ genome in yeast, Plos One, 10(4)(2012):e7561
  24. (with H. Li) Color degree and alternating cycles in edge-colored graphs. Discrete Mathematics 309(13)(2009), 4349-4354.
  25. (with G. Liu) Paths, cycles and circular colorings in digraphs. Theor. Comput. Sci. 410(21-23)(2009),1982-1985.
  26. (with H. Li, X. Li and G. Liu) The heterochromatic matchings in edge-colored bipartite graph, Ars combinatorica, 93(2009), 129-139.
  27. (with H. Li) Heterochromatic matchings in edge-colored graphs. Electron. J. Combin. 15 (2008), #R138.
  28. (with H. Li) Color degree and heterochromatic matchings in edge-colored bipartite graphs, Utilitas Mathematica, 77(2008), 145-154
  29. (with T. Kaiser, R. Kuzel and H. Li) A Note on k -walks in Bridgeless Graphs. Graphs and Combinatorics 23(3)(2007),303-308.
  30. (with H. Li and S. Zhou) Long Alternating  Cycles in Edge-Colored Complete Graphs. Lecture Notes in Computer Science  2007,305-309.
  • 已毕业研究生 (以入学时间为序)

硕士研究生:李华龙,丁来浩、于筱蔚、曲存全(硕博连读)

  • 在读研究生(以入学时间为序)

硕士研究生:胡杰,牛亚伟

博士研究生:李瞳