颜谨教授
山东大学数学学院教授，博士研究生导师，硕士研究生导师，系统与运筹学研究所所长 邮箱：yanj@sdu.edu.cn。 加拿大新不伦瑞克博士后，中国运筹学会图论组合分会常务理事，中国工业与应用数学学会图论组合及其应用专业委员会委员，中国工业与应用数学学会信息和通讯技术领域的数学专业委员会委员。主要研究方向为图论与网络优化，共发表学术论文90余篇，在网络优化方向解决了Schrijver提出的关于网络合成的公开问题和美国学者Angel提出的双目标优化问题的猜想，在图论方向解决了Enom... More+
- [1] 颜谨. 二分图中含大圈的 2―因子（英文）. 工程数学学报, 910-914, 2004.
- [2] 颜谨. 二分图中关于Enomoto问题的结果. 中国科学A辑数学, 39, 507-514, 2009.
- [3] 王凯可. Spanning 3-strong tournaments in 5-strong semicomplete digraphs. Discrete Mathematics, 347, 2024.
- [4] 衣晓宁. 图中点不交的4-圈. 应用数学进展, 5, 399-405, 2016.
- [5] 王赟. Packing a number of copies of a (p,q)-graph. Discrete Applied Mathematics, 289, 302-312, 2021.
- [6] . Disjoint cycles covering specified vertices in bipartite graphs with partial degrees. Applied Mathematics and Computation, 2023.
- [7] 周佳. Improved results on linkage problems. Discrete Mathematics, 2023.
- [8] . DISJOINT CYCLES IN A DIGRAPH WITH PARTIAL DEGREE. SIAM JOURNAL ON DISCRETE MATHEMATICS, 37, 221-232, 2023.
- [9] 王志兰. Vertex-disjoint cycles of the same length in tournaments. JOURNAL OF GRAPH THEORY, 102, 666-683, 2022.
- [10] 江素云. Disjoint cycles covering specified vertices in bipartite graphs with partial degrees. Applied Mathematics and Computation, 439, 2023.
- [11] 周佳. Improved results on linkage problems. Discrete Mathematics, 346, 2023.
- [12] 祁玉珍. Disjoint cycles with partial degree conditions in claw-free graphs. Discrete Mathematics, 346, 2023.
- [13] 宋春娇. Disjoint Cycles and Degree Sum Condition in a Graph. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2023.
- [14] 宋春娇. Partition and Disjoint Cycles in Digraphs. Graphs and Combinatorics, 39, 2023.
- [15] 李硕. 均衡二部图中点不交的4-圈和6-圈（英文）. 数学进展, 0, 61-65, 2015.
- [16] 祁玉珍. Cycle Extendability in Extended Tournaments. Graphs and Combinatorics, 38, 2022.
- [17] 张婕. Disjoint cycles and 2-factors with Fan-type condition in a graph. Discrete Mathematics, 345, 2022.
- [18] Lai, Hong-Jian. Every 3-Connected Claw-Free Z(8)-Free Graph Is Hamiltonian. JOURNAL OF GRAPH THEORY, 64, 1-11, 2010.
- [19] 张欣. Vertex-disjoint triangles in K-1,K-t-free graphs with minimum degree at least t. Discrete Mathematics, 310, 2499-2503, 2010.
- [20] 王赟. Packing a number of copies of a (p, q)-graph. Discrete Applied Mathematics, 289, 302, 2021.