颜谨教授
山东大学数学学院教授，博士研究生导师，硕士研究生导师，系统与运筹学研究所所长 邮箱：yanj@sdu.edu.cn。 加拿大新不伦瑞克博士后，中国运筹学会图论组合分会常务理事，中国工业与应用数学学会图论组合及其应用专业委员会委员，中国工业与应用数学学会信息和通讯技术领域的数学专业委员会委员。主要研究方向为图论与网络优化，共发表学术论文90余篇，在网络优化方向解决了Schrijver提出的关于网络合成的公开问题和美国学者Angel提出的双目标优化问题的猜想，在图论方向解决了Enom... More+
- [101] 颜谨. A Vertex cover with chorded 4-cycles. Acta Mathematica Sinica, 27, 2351, 2011.
- [102] 任燕燕 and 颜谨. Degree sum conditions on two disjoint cycles in graphs. information processing letters, 138, 7, 2018.
- [103] 颜谨. Fan-type condition on disjoint cycles in a graph. Discrete Mathematics, 341, 1160, 2018.
- [104] 颜谨. Disjoint cycles in directed graphs. ARS Combinatoria, 136, 21, 2018.
- [105] 颜谨. Disjoint directed triangles and quadrilaterals in directed graphs. UTILITAS MATHEMATICA, 102, 3, 2017.
- [106] Packing a number of copies of a $(p,\,q)$-graph. European Journal of Combinatorics, 2018.
- [107] Packing $k$ disjoint copies of $K_{1,4}$ in claw-free graphs. Graphs and Combinatorics, 2018.
- [108] An improvement of Lichiardopol's theorem on disjoint cycles in tournaments. Applied Mathematics and Computation, 2018.
- [109] Disjoint cycles on Lichiardopol’s conjecture in tournaments. The Electronic Journal of Combinatorics, 2018.
- [110] The confirmation of a conjecture on disjoint cycles in a graph. Discrete Mathematics, 341, 2903-2911, 2018.
- [111] Degree sum conditions on two disjoint cycles in graphs. Information Processing Letters, 138, 7-11, 2018.
- [112] Disjoint cliques in claw-free graphs. Acta Mathematicae Applicatae Sinica-English Series, 34, 19-34, 2018.
- [113] Vertex-disjoint copies of K1,t in K1,r-free graphs. Discrete Mathematics, 340, 649-654, 2017.
- [114] Disjoint cycles in a graph with distance degree sum conditions. Discrete Mathematics, 340, 1203-1209, 2017.
- [115] Vertex-disjoint copies of K1,3 in K1,r-free graphs. Discrete Mathematics, 339, 3085-3088, 2016.
- [116] Vertex-disjoint cycles containing specified vertices in a bipartite graph. Graph and Combinatorics, 32, 2171-2181, 2017.