- [81] 颜谨. New sufficient conditions for s-Hamiltonian graphs and s-Hamiltonian connected graphs. ARS Combinatoria, 88, 217, 2008.
- [82] 颜谨. On 2-factors with quadrilaterals containing specified vertices in a bipartite graph. ARS Combinatoria, 82, 133, 2007.
- [83] 刘桂真 and 颜谨. On 2-factors with prescribed properties in a bipartite graph. Acta Mathematica Sinica-English Series, 22, 1115, 2006.
- [84] 颜谨. Disjoint triangles and quadrilaterals in a graph. Discrete Mathematics, 308, 3930, 2008.
- [85] 颜谨. On 2-factors with cycles containing specified edges in a bipartite graph. Discrete Mathematics, 309, 1112, 2009.
- [86] 颜谨. An improved lower bound for a bi-criteria scheduling problem. Operations Research Letters, 36, 57, 2008.
- [87] 颜谨. Color degree and heterochromatic paths in edge-colored graphs. ARS Combinatoria, 116, 171, 2014.
- [88] 颜谨. Graph partition into small cliques. Discrete Applied Mathematics, 162, 322, 2014.
- [89] 颜谨. Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs. ARS Combinatoria, 109, 405, 2013.
- [90] 颜谨. On 2-Factors with chorded quadrilaterals in graphs. ARS Combinatoria, 98, 193, 2011.
- [91] 颜谨. Contractible configurations on 3-flows in graphs satisfying the Fan-condition. European J. Combinatorics, 34, 892, 2013.
- [92] 刘桂真 and 颜谨. Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph. J Appl Math Comput, 27, 23, 2008.
- [93] 颜谨. Nowhere-zero 3-flows and Z_3-connectivity of a family of graphs. Discrete Mathematics, 311, 1988, 2011.
- [94] 颜谨. Integer exact network synthesis problem. SIAM J. Discrete Math., 23, 136, 2008.
- [95] 颜谨. Group connectivity in products of graphs. International Journal of Algebra, 4, 1185, 2010.
- [96] 颜谨. Every 3-connected claw-free Z8-free graph is Hamiltonian. J. Graph Theory, 64, 1, 2010.
- [97] 颜谨. A Vertex cover with chorded 4-cycles. Acta Mathematica Sinica, 27, 2351, 2011.
- [98] 任燕燕 and 颜谨. Degree sum conditions on two disjoint cycles in graphs. information processing letters, 138, 7, 2018.
- [99] 颜谨. Fan-type condition on disjoint cycles in a graph. Discrete Mathematics, 341, 1160, 2018.
- [100] 颜谨. Disjoint cycles in directed graphs. ARS Combinatoria, 136, 21, 2018.