王光輝

山東大學數學學院副教授

王光輝,男,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,邊染色圖中的子圖,教育部留學回國人員科研啟動基金,負責人

論文期刊

(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.
(with H. Li) Color degree and Heterechromatic cycles in edge-colored graphs, European J. Comb. to appear.
(with G. Liu) Circular colorings of digraphs, Graph and Combinatorics, to appear.
(with G. Liu) Circular choosability of planar graphs with large girth, Ars Combinatorics, to appear.
(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.
(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.
(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.
(with J. Hou and G. Liu) Improved bounds for acyclic chromatic index of planar graphs, Discrete Mathematics, 159 (2011), 876-881.
Rainbow matchings in properly edge-colored graphs, Electronic Journal of Combinatorics, 18 (2011), #R162.
(with S. Zhou, J. Wu and G. Liu) Circular vertex arboricity. Discrete Applied Mathematics 159(12): 1231-1238 (2011)
(with S. Zhou and H. Li) The k-dominating cycles in graphs. Eur. J. Comb. 31(2): 608-616 (2010)
(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.
(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.
(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
(with H. Li) Color degree and alternating cycles in edge-colored graphs. Discrete Mathematics 309(13)(2009), 4349-4354.
(with G. Liu) Paths, cycles and circular colorings in digraphs. Theor. Comput. Sci. 410(21-23)(2009),1982-1985.
(with H. Li, X. Li and G. Liu) The heterochromatic matchings in edge-colored bipartite graph, Ars combinatorica, 93(2009), 129-139.
(with J. Yu and S. Cui)Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings. COCOA (2009), LNCS 5573(2009),519-529
(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
(with H. Li) Heterochromatic matchings in edge-colored graphs. Electron. J. Combin. 15 (2008), #R138.
(with H. Li) Color degree and heterochromatic matchings in edge-colored bipartite graphs, Utilitas Mathematica, 77(2008), 145-154
(with T. Kaiser, R. Kuzel and H. Li) A Note on k -walks in Bridgeless Graphs. Graphs and Combinatorics 23(3)(2007),303-308.
(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.
(with G. Liu and J. Yu) Circular list colorings of some graphs, J. Appl. Math. Computing, 20(1-2)(2006), 149-156.