山东大学数学学院导师介绍：王光辉

　　王光辉，1979年11月生；副教授，硕士生导师。

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

　　学习经历
　　2005.11—2007.7，法国巴黎南大学信息科学实验室，博士学位
　　2001.9—2005.10，山东大学数学学院，硕博连读
　　1997.9—2001.7，山东大大学数学学院，学士学位

　　项目
　　2012—2014,，图的子图和染色，国家自然科学基金（青年基金），负责人
　　2011—2012，图的彩色子图，国家自然科学基金（数学天元基金），负责人
　　2011—2013，边染色图的结构和性质，教育部高校博士点专项基金，负责人
　　2009—2011，边染色图中的子图，教育部留学回国人员科研启动基金，负责人

　　论文
　　24.(with H. Li, Y. Zhu and G. Liu) A note on heterochromatic $C_4$ in edge-colored triangle-free graphs Graph and Combinatorics, to appear.
　　23.(with H. Li) Color degree and Heterechromatic cycles in edge-colored graphs, European J. Comb. to appear.
　　22.(with G. Liu) Circular colorings of digraphs, Graph and Combinatorics, to appear.
　　21.(with G. Liu) Circular choosability of planar graphs with large girth, Ars Combinatorics, to appear.
　　20.(with J. Yu and N. Wang) Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks, J. Parallel Distrib. Comput. ,to appear.
　　19.(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 (AEÜ) (2011), doi:10.1016/j.aeue.2011.05.002.
　　18.(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.
　　17.(with J. Hou and G. Liu) Improved bounds for acyclic chromatic index of planar graphs, Discrete Mathematics, 159 (2011), 876-881.
　　16.Rainbow matchings in properly edge-colored graphs, Electronic Journal of Combinatorics, 18 (2011), #R162.
　　15.(with S. Zhou, J. Wu and G. Liu) Circular vertex arboricity. Discrete Applied Mathematics 159(12): 1231-1238 (2011)
　　14.(with S. Zhou and H. Li) The k-dominating cycles in graphs. Eur. J. Comb. 31(2): 608-616 (2010)
　　13.(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.
　　12.(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.
　　11.(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
　　10.(with H. Li) Color degree and alternating cycles in edge-colored graphs. Discrete Mathematics 309(13)(2009), 4349-4354.
　　9.(with G. Liu) Paths, cycles and circular colorings in digraphs. Theor. Comput. Sci. 410(21-23)(2009),1982-1985.
　　8.(with H. Li, X. Li and G. Liu) The heterochromatic matchings in edge-colored bipartite graph, Ars combinatorica, 93(2009), 129-139.
　　7.(with J. Yu and S. Cui)Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings. COCOA (2009), LNCS 5573(2009),519-529
　　6.(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
　　5.(with H. Li) Heterochromatic matchings in edge-colored graphs. Electron. J. Combin. 15 (2008), #R138.
　　4.(with H. Li) Color degree and heterochromatic matchings in edge-colored bipartite graphs, Utilitas Mathematica, 77(2008), 145-154
　　3.(with T. Kaiser, R. Kuzel and H. Li) A Note on k -walks in Bridgeless Graphs. Graphs and Combinatorics 23(3)(2007),303-308.
　　2.(with H. Li and S. Zhou) Guanghui Wang, Shan Zhou: Long Alternating Cycles in Edge-Colored Complete Graphs. Lecture Notes in Computer Science 2007,305-309.
　　1.(with G. Liu and J. Yu) Circular list colorings of some graphs, J. Appl. Math. Computing, 20(1-2)(2006), 149-156.

　　*如果发现导师信息存在错误或者偏差，欢迎随时与我们联系，以便进行更新完善。联系方式>>