颜谨教授
山东大学数学学院教授，博士研究生导师，硕士研究生导师，系统与运筹学研究所所长 邮箱：yanj@sdu.edu.cn。 加拿大新不伦瑞克博士后，中国运筹学会图论组合分会常务理事，中国工业与应用数学学会图论组合及其应用专业委员会委员，中国工业与应用数学学会信息和通讯技术领域的数学专业委员会委员。主要研究方向为图论与网络优化，共发表学术论文90余篇，在网络优化方向解决了Schrijver提出的关于网络合成的公开问题和美国学者Angel提出的双目标优化问题的猜想，在图论方向解决了Enom... More+
- [61] XWFZR , 颜谨 and 校外负责人. Disjoint small cycles in graphs. J Appl Math. Informatics, 27, 809, 2009.
- [62] 颜谨 and 校外负责人. On 2-factors with cycles containing specified vertices in a bipartite graph. J Appl Math Comput., 31, 203, 2009.
- [63] 颜谨 and 校外负责人. Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs. Graphs and Combinatorics, 29, 1337, 2013.
- [64] 颜谨 and 校外负责人. Graph partition into K3s and K4s . J Appl Math. Comput, 34, 273, 2010.
- [65] 颜谨 and 吴建良. Degree conditions for the partition of a graph into triangles and quadrilaterals . UTILITAS MATHEMATICA, 86, 341, 2011.
- [66] 颜谨 and 校外负责人. Disjoint cycles and chorded cycles in graphs. Proceedings of The 2008 International Conference on Foundations of Computer Science (FCS'08),, 9, 2008.
- [67] 颜谨 and 吴建良. Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t. Discrete Mathematics, 310, 2499, 2010.
- [68] 颜谨 and 校外负责人. Disjoint small cycles in graphs. J Appl Math. Informatics, 27, 809, 2009.
- [69] 颜谨 and 吴建良. Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t. Discrete Mathematics, 310, 2499, 2010.
- [70] 颜谨 and 江素云. Vertex-disjoint copies of K-1,K-t in K-1,K-r-free graphs. Discrete Mathematics, 340, 649, 2017.
- [71] 颜谨 and 吴建良. Degree conditions for the partition of a graph into triangles and quadrilaterals . UTILITAS MATHEMATICA, 86, 341, 2011.
- [72] 颜谨 and 焦智慧. Disjoint cycles in graphs with distance degree sum conditions. Discrete Mathematics, 340, 1203, 2017.
- [73] 颜谨 and 校外负责人. On 2-factors with cycles containing specified vertices in a bipartite graph. J Appl Math Comput., 31, 203, 2009.
- [74] 颜谨 and 校外负责人. Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs. Graphs and Combinatorics, 29, 1337, 2013.
- [75] 颜谨 and 校外负责人. Graph partition into K3s and K4s . J Appl Math. Comput, 34, 273, 2010.
- [76] 颜谨 and 校外负责人. Disjoint cycles and chorded cycles in graphs. Proceedings of The 2008 International Conference on Foundations of Computer Science (FCS'08),, 9, 2008.
- [77] 颜谨 and 校外负责人. Disjoint small cycles in graphs. J Appl Math. Informatics, 27, 809, 2009.
- [78] 颜谨 and 马富红. ON THE NUMBER OF DISJOINT 4-CYCLES IN REGULAR TOURNAMENTS. Discussiones Mathematicae Graph Theory, 38, 491, 2018.
- [79] 颜谨 and 江素云. Disjoint cliques in claw-free graphs. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 34, 19, 2018.
- [80] 颜谨 and 马富红. The confirmation of a conjecture on disjoint cycles in a graph. Discrete Mathematics, 341, 2903, 2018.