颜谨

  • 颜谨

山东大学数学学院教授,硕士研究生导师. 主要研究方向为图论与组合优化算法.

  • 工作经历

  • 2014.10至今山东大学数学学院教授
  • 2002.09- 山东大学数学学院副教授
  • 2000.07- 山东大学数学学院讲师
  • 1996.07- 2000.07 山东工业大学讲师
  • 1995.07-1996.07 山东工业大学助教
  • 学术经历

  • 2009.01-2010.01,West Virginia University,USA访问学者
  • 2006.02-2006.04, West Virginia University,USA访问学者
  • 2005.03-2006.02, University of New Brunswick,CANADA博士后
  • 学习经历

  • 2003.06, 山东大学, 博士学位
  • 1995.07, 山东大学, 硕士学位
  • 1990.07, 山东工业大学, 学士学位
  • 主持与承担过的项目

  1. 网络问题与图的圈路问题研究,山东省中青年科学家科研奖励基金,批准号2007BS01021,6万元,2007-2009,主持
  2. 图的圈、2-因子和网络合成问题研究,教育部留学归国人员科研启动基金,2万元,2007,主持.
  3. 图上有约束条件的染色问题研究,国家自然科学基金,批准号10871119,35万元,2009.1-2011.12, 项目主持人:刘桂真. 颜谨:3/10位.
  4. 图与网络技术在计算机科学中的应用,国家自然科学基金,批准号60673047,26万元,2007.1-2009.12,项目主持人:刘桂真. 颜谨:2/10位.
  5. 图的(g,f)-染色理论研究,国家自然科学基金,批准号10471078,23万元,2005.1-2007.12, 项目主持人:刘桂真. 颜谨:4/10位.
  6. 网络分解与算法研究, 国家自然科学基金,批准号60172003,18万元,2002.1-2004.12, 项目主持人:刘桂真. 颜谨:7/7位.
  7. 图的因子与因子分解,高等学校博士学科点专项科研基金,5万元,2005.01-2007.12项目主持人:刘桂真. 颜谨:4/10位.
  • 论著代表作

  1. S. N. Kabadi, J. Yan, D. Du and N. P. K. Nair, Integer exact network synthesis problem,SIAM J. Discrete Math.,Vol. 23(1) (2008), 136-154. (国外,SCI)
  2. Hong-Jian Lai, Liming Xiong, Huiya Yan and Jin Yan, Every 3-connected claw-free Z8-free graph is Hamiltonian, J. Graph Theory, Vol. 64 (2010), 1-11. (国外,SCI,署名按字母排序)
  3. J. Yan,H-J Lai, X. Gu and S. Yao, Group connectivity in product graphs, International Journal of Algebra, Vol. 4 (2010), 1185 – 1200. (国外,SCI)
  4. J. Yan, Nowhere-zero 3-flows and Z_3-connectivity of a family of graphs, Discrete Mathematics,Vol. 311 (2011),1988 – 1994. (国外,SCI)
  5. J. Yan, An improved lower bound for a bi-criteria scheduling problem, Operations Research Letters,Vol. 36(2008),57-60. (国外,SCI)
  6. J. Yan, Disjoint triangles and quadrilaterals in a graph, Discrete Mathematics,Vol. 308 (2008),3930 – 3937. (国外,SCI)
  7. J. Yan and G Liu, On 2-factors with cycles containing specified edges in a bipartite graph, Discrete Math., Vol. 309 (2009), 1112 – 1117. (国外,SCI)
  8. YAN Jin and GAO YunShu, On Enomoto’s problems in a bipartite graph, Science in China Series A: Mathematics, Vol. 52 (9) (2009), 1947–- 1954 . (SCI)
  9. J. Yan and G. Z. Liu, On 2-factors with prescribed properties in a bipartite graph, Acta Mathematica Sinica, Vol. 22(4) (2006), 1115-1120. (SCI)
  10. Yan J., Hong-Jian Lai and Ju Zhou, New sufficient conditions on Hamiltonian connected graph and s-Hamiltonian graph, Ars. Combin., Vol. 88(2008), 217-227. (国外,SCI)
  11. J. Yan and G. Z. Liu, On 2-factors with quadrilaterals containing specified vertices of a bipartite graph, Ars. Combin., Vol.82 (2007), 133-144. (国外,SCI)
  12. J. Yan and G. Z. Liu, Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph,J Appl Math Comput., Vol. 27 (2008), 23 – 31. (国外,SCI)
  13. J. Yan and G. Z. Liu, Vertex-disjoint quadrilaterals in bipartite graphs,J. System Sciences and Complexity (SCI),Vol.17 (4) (2004), 532-537.
  14. Y. Gao, J. Yan and G. Li, On 2-factors with cycles containing specified vertices in a bipartite graph, J Appl Math Comput., Vol. 31(2009), 203-215. (国外,SCI)
  15. Y. Gao, G. Li, J. Yan and Z. Su, Disjoint cycles and chorded cycles in graphs, Proceedings of The 2008 International Conference on Foundations of Computer Science (FCS’08), Las Vegas, July 2008. (国外,EI,ISTP)
  16. B. Zhang and J. Yan, Graph partition into K3s and K4s, J Appl Math. Comput., Vol. 34 (2010), 273-285. (国外,SCI)
  17. Y. Gao, G. Li and J. Yan, Disjoint small cycles in graphs, J Appl Math. Informatics, Vol. 27(2009), 809 – 817. (国外)
  18. J.Yan and G.Z.Liu,Vertex-disjoint quadrilaterals in bipartite graphs,J. System Sciences and Complexity,Vol.17(4)(2004), 532-537.(SCI)
  19. Y.Gao, G. Li and J. Yan, A Vertex Cover with Chorded 4-cycles, Acta Mathematica Sinica, Vol. 27(4) (2011), 1-10. (SCI)
  20. J.Yan and G.Z.Liu, On 2-factors with large cycles in a balanced bipartite graph, J. Engineering Math.,Vol. 21(6)(2004), 910-914.
  21. J.Yan and G.Z.Liu, A new result on large independent cycles,Proceedings of the International Conference on Mathematical Programming (2002), 400-406.
  22. J.Yan, Some results on cycles and paths in graphs, Proceedings of the Seventh National Conference of Operations Research Society of China (2003),706-712.
  23. J.Yan and G.Z.Liu,Quadrilaterals and paths of order 4 in graphs, 数学物理学报 (2003), Vol. 23A(6):711-718.
  24. J. Yan and G.Z.Liu,A constructing proof on cycles and matching in balanced bipartite graphs, 山东大学学报(理学版)(2003), Vol.38(4): 53-57.
  25. J.Yan,Independent cycles in bipartite graphs,山东大学学报(理学版)(2002), Vol.37(5):396-400.
  26. Y. Gao, J. Yan, On 2-Factors with chorded quadrilaterals in graphs. Ars Combinatoria, accepted.(SCI)
  27. Y. Gao, G. Li and J. Yan, Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs. Ars Combinatoria, accepted.(SCI)
  28. Y. Gao, G. Li, J. Yan and Z. Su, Disjoint cycles and chorded cycles in graphs, Proceedings of The 2008 International Conference on Foundations of Computer Science (FCS’08), Las Vegas, July 2008. (EI,ISTP)
  29. 高云澍, 颜谨. 无爪图中具有指定长度的路因子[J]. 山东大学学报(理学版 ) (2006), 5-10.
  30. Y. Gao, G. Li and J. Yan, Disjoint small cycles in graphs, J Appl Math informatics, in press.
  31. 耿建艳,颜谨,高云澍,半无爪图中的路因子,山东大学学报(理学版)(2007), 42 (12):73-76.
  • 获奖与资助

  1. 获2004年山东省优秀博士学位论文奖(导师刘桂真教授)
  2. 获2004年山东高等学校优秀科研成果二等奖
  3. 2005年在加拿大做博士后期间获加拿大自然科学与工程研究理事会基金(NSERC)资助
  4. 2006年在美国West Virginia University访问期间获West Virginia University基金资助
  5. 2009年获国家留学基金委与山东大学1:1配套基金资助.
  • 已毕业研究生(以毕业先后为序)

高云澍,耿建艳,刘东,于潇,李硕,李峰,张蓓蓓,庄永振,张颖

  • 在读研究生(以入学先后为序)

贺秀秀,邹敏,丁录顺,温楠