颜谨教授
山东大学数学学院教授，博士研究生导师，硕士研究生导师，系统与运筹学研究所所长 邮箱：yanj@sdu.edu.cn。 加拿大新不伦瑞克博士后，中国运筹学会图论组合分会常务理事，中国工业与应用数学学会图论组合及其应用专业委员会委员，中国工业与应用数学学会信息和通讯技术领域的数学专业委员会委员。主要研究方向为图论与网络优化，共发表学术论文90余篇，在网络优化方向解决了Schrijver提出的关于网络合成的公开问题和美国学者Angel提出的双目标优化问题的猜想，在图论方向解决了Enom... More+
- [41] 颜谨. Graph partition into small cliques. Discrete Applied Mathematics, 162, 322, 2014.
- [42] 颜谨. Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs. ARS Combinatoria, 109, 405, 2013.
- [43] 颜谨. On 2-Factors with chorded quadrilaterals in graphs. ARS Combinatoria, 98, 193, 2011.
- [44] XWFZR , 颜谨 and 校外负责人. Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs. Graphs and Combinatorics, 29, 1337, 2013.
- [45] XWFZR , 颜谨 and 校外负责人. Graph partition into K3s and K4s . J Appl Math. Comput, 34, 273, 2010.
- [46] 吴建良 , XWFZR and 颜谨. Degree conditions for the partition of a graph into triangles and quadrilaterals . UTILITAS MATHEMATICA, 86, 341, 2011.
- [47] XWFZR , 颜谨 and 校外负责人. Disjoint cycles and chorded cycles in graphs. Proceedings of The 2008 International Conference on Foundations of Computer Science (FCS'08),, 9, 2008.
- [48] 颜谨. Contractible configurations on 3-flows in graphs satisfying the Fan-condition. European J. Combinatorics, 34, 892, 2013.
- [49] 吴建良 and 颜谨. Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t. Discrete Mathematics, 310, 2499, 2010.
- [50] 颜谨 and 刘桂真. Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph. Journal of Applied Mathematics and Computing, 27, 23, 2008.
- [51] 颜谨 and XWFZR. Every 3-connected claw-free Z8-free graph is Hamiltonian. J. Graph Theory, 64, 1, 2010.
- [52] 颜谨. On Enomoto‘s problems in a bipartite graph. SCIENCE IN CHINA SERIES A-MATHEMATICS, 52, 1947, 2009.
- [53] 颜谨 and 刘桂真. On 2-factors with prescribed properties in a bipartite graph. Acta Mathematica Sinica-English Series, 22, 1115, 2006.
- [54] 颜谨. Nowhere-zero 3-flows and Z_3-connectivity of a family of graphs. Discrete Mathematics, 311, 1988, 2011.
- [55] 颜谨. New sufficient conditions for s-Hamiltonian graphs and s-Hamiltonian connected graphs. ARS Combinatoria, 88, 217, 2008.
- [56] 颜谨 and XWFZR. Integer exact network synthesis problem. SIAM J. Discrete Math., 23, 136, 2008.
- [57] 颜谨. On 2-factors with cycles containing specified edges in a bipartite graph. Discrete Mathematics, 309, 1112, 2009.
- [58] 颜谨. An improved lower bound for a bi-criteria scheduling problem. Operations Research Letters, 36, 57, 2008.
- [59] 颜谨. On 2-factors with quadrilaterals containing specified vertices in a bipartite graph. ARS Combinatoria, 82, 133, 2007.
- [60] 颜谨. Disjoint cycles in directed graphs. ARS Combinatoria, 136, 21, 2018.