王光辉

  • 王光辉

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

  • 学术经历

  • 2009—,山东大学数学学院,副教授
  • 2008.3—2009.9,法国中央理工学院应用数学实验室,博士后
  • 学习经历

  • 2005.11—2007.7,法国巴黎南大学信息科学实验室,博士学位
  • 2001.9—2005.10,山东大学数学学院,硕博连读
  • 1997.9—2001.7,山东大大学数学学院,学士学位
  • 项目

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

  1. (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
  2. (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
  3. (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.
  4. (with A. Dong) Neighbor sum distinguishing coloring of some graphs, Discrete Mathematics Algorithms and Applications, 4(4)(2012),1250047.
  5. (with X. Zhang et al.) On r-acyclic edge colorings of planar graphs, Discrete Applied Mathemaitcs,160(13-14)(2012),2048-2053.
  6. (With J. Cai and G. Yan) Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable, Science China Mathematics,55(12)(2012),2601-2612.
  7. (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
  8. (with H. Li) Color degree and Heterechromatic cycles in edge-colored graphs, European J. Comb. 33 (8)(2012), 1958-1964.
  9. (with B. Liu, G. Yu and G. Liu) Circular colorings of digraphs, Graph and Combinatorics, 28(6)(2012), 889-900.
  10. (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.
  11. (with J. Yu, Y. Qi and X. Gu) A cluster-based routing protocol for wireless sensor networks with nonuniform node distribution, Internal Journal of Electronics and Communications (AEU), 66(1)(2012),54-61.
  12. (with G. Liu) Circular choosability of planar graphs with large girth, Ars Combinatoria 99(2011), 65-73.
  13. (with J. Yu and Y. Qi) An energy-driven unequal clustering protocol for heterogeneous wireless sensor networks, Journal of Control Theory Appl., 9 (1)(2011),133-139.
  14. (with J. Hou and G. Liu) Improved bounds for acyclic chromatic index of planar graphs, Discrete Mathematics, 159 (2011), 876-881.
  15. Rainbow matchings in properly edge-colored graphs, Electronic Journal of Combinatorics, 18 (2011), #R162.
  16. (with S. Zhou, J. Wu and G. Liu) Circular vertex arboricity. Discrete Applied Mathematics 159(12): 1231-1238 (2011)
  17. (with S. Zhou and H. Li) The k-dominating cycles in graphs. Eur. J. Comb. 31(2): 608-616 (2010)
  18. (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.
  19. (with J. Yu and N. Wang) Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks. WASA (2010),11-20.
  20. (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, Public library of science one, 10(4)(2009):e7531
  21. (with H. Li) Color degree and alternating cycles in edge-colored graphs. Discrete Mathematics 309(13)(2009), 4349-4354.
  22. (with G. Liu) Paths, cycles and circular colorings in digraphs. Theor. Comput. Sci. 410(21-23)(2009),1982-1985.
  23. (with H. Li, X. Li and G. Liu) The heterochromatic matchings in edge-colored bipartite graph, Ars combinatorica, 93(2009), 129-139.
  24. (with J. Yu and S. Cui)Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings. COCOA (2009), LNCS 5573(2009),519-529
  25. (with J. Yu and S. Cui) An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings. COCOA 2009, LNCS 5573(2009), 530-540
  26. (with H. Li) Heterochromatic matchings in edge-colored graphs. Electron. J. Combin. 15 (2008), #R138.
  27. (with H. Li) Color degree and heterochromatic matchings in edge-colored bipartite graphs, Utilitas Mathematica, 77(2008), 145-154
  28. (with T. Kaiser, R. Kuzel and H. Li) A Note on k -walks in Bridgeless Graphs. Graphs and Combinatorics 23(3)(2007),303-308.
  29. (with H. Li and S. Zhou) Long Alternating  Cycles in Edge-Colored Complete Graphs. Lecture Notes in Computer Science  2007,305-309.
  30. (with G. Liu and J. Yu) Circular list colorings of some graphs, J. Appl. Math. Computing, 20(1-2)(2006), 149-156.
  • 在读硕士研究生

李华龙, 丁来浩,于筱蔚,曲存全