颜谨教授
山东大学数学学院教授，博士研究生导师，硕士研究生导师，系统与运筹学研究所所长 邮箱：yanj@sdu.edu.cn。 加拿大新不伦瑞克博士后，中国运筹学会图论组合分会常务理事，中国工业与应用数学学会图论组合及其应用专业委员会委员，中国工业与应用数学学会信息和通讯技术领域的数学专业委员会委员。主要研究方向为图论与网络优化，共发表学术论文90余篇，在网络优化方向解决了Schrijver提出的关于网络合成的公开问题和美国学者Angel提出的双目标优化问题的猜想，在图论方向解决了Enom... More+
- [81] 颜谨 and 江素云. Disjoint cliques in claw-free graphs. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 34, 19, 2018.
- [82] 颜谨 and 马富红. The confirmation of a conjecture on disjoint cycles in a graph. Discrete Mathematics, 341, 2903, 2018.
- [83] 颜谨 and 江素云. Partial Degree Conditions and Cycle Coverings in Bipartite Graphs. Graphs and Combinatorics, 33, 955, 2017.
- [84] 颜谨. On Enomoto‘s problems in a bipartite graph. SCIENCE IN CHINA SERIES A-MATHEMATICS, 52, 1947, 2009.
- [85] 颜谨. New sufficient conditions for s-Hamiltonian graphs and s-Hamiltonian connected graphs. ARS Combinatoria, 88, 217, 2008.
- [86] 颜谨. On 2-factors with quadrilaterals containing specified vertices in a bipartite graph. ARS Combinatoria, 82, 133, 2007.
- [87] 刘桂真 and 颜谨. On 2-factors with prescribed properties in a bipartite graph. Acta Mathematica Sinica-English Series, 22, 1115, 2006.
- [88] 颜谨. Disjoint triangles and quadrilaterals in a graph. Discrete Mathematics, 308, 3930, 2008.
- [89] 颜谨. On 2-factors with cycles containing specified edges in a bipartite graph. Discrete Mathematics, 309, 1112, 2009.
- [90] 颜谨. An improved lower bound for a bi-criteria scheduling problem. Operations Research Letters, 36, 57, 2008.
- [91] 颜谨. Color degree and heterochromatic paths in edge-colored graphs. ARS Combinatoria, 116, 171, 2014.
- [92] 颜谨. Graph partition into small cliques. Discrete Applied Mathematics, 162, 322, 2014.
- [93] 颜谨. Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs. ARS Combinatoria, 109, 405, 2013.
- [94] 颜谨. On 2-Factors with chorded quadrilaterals in graphs. ARS Combinatoria, 98, 193, 2011.
- [95] 颜谨. Contractible configurations on 3-flows in graphs satisfying the Fan-condition. European J. Combinatorics, 34, 892, 2013.
- [96] 刘桂真 and 颜谨. Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph. J Appl Math Comput, 27, 23, 2008.
- [97] 颜谨. Nowhere-zero 3-flows and Z_3-connectivity of a family of graphs. Discrete Mathematics, 311, 1988, 2011.
- [98] 颜谨. Integer exact network synthesis problem. SIAM J. Discrete Math., 23, 136, 2008.
- [99] 颜谨. Group connectivity in products of graphs. International Journal of Algebra, 4, 1185, 2010.
- [100] 颜谨. Every 3-connected claw-free Z8-free graph is Hamiltonian. J. Graph Theory, 64, 1, 2010.