顏謹，女，博士，山東大學教授。
基本介紹
- 中文名：顏謹
- 學位/學歷：博士
- 職業：教師
- 專業方向：運籌學
- 任職院校：山東大學
個人經歷,主講課程,研究方向,學術成果,榮譽獎項,
個人經歷
1986.9-1990.7
2000.9-2003.6
山東大學| 運籌學與控制論| 理學博士學位| 博士研究生畢業
1992.9-1995.7
山東大學| 運籌學與控制論| 理學碩士學位| 碩士研究生畢業
工作經歷
山工大數理系
數學學院|山東大學|教授|在職
社會兼職
任中國運籌學會圖論組合分會常務理事，
中國工業與套用數學學會圖論組合及其套用專業委員會委員
主講課程
本科生課程
課程名稱： | 學年： | 學期： | 學時： | 學分： | 課程號： |
高等數學(1) | 2019-2020 | 秋學期 | 80 | 5 | sd00920120 |
高等數學(1) | 2018-2019 | 春學期 | 80 | 5 | sd00920120 |
組合最佳化 | 2018-2019 | 秋學期 | 54 | 3 | 0190072 |
高等數學 | 2018-2019 | 秋學期 | - | - | sd00920120 |
高等數學(2) | 2017-2018 | 春學期 | 80 | 5 | sd00920130 |
組合最佳化 | 2016-2017 | 秋學期 | 54 | 3 | 0190072 |
研究生課程
課程名稱： | 學年： | 學期： | 學時： | 學分： | 課程號： |
圖論及其套用 | 2019-2020 | 秋學期 | 54 | 3 | 0190071 |
有向圖--理論、算... | 2019-2020 | 春學期 | 36 | 2 | 0190178 |
圖論及其套用 | 2019-2020 | 秋學期 | 54 | 3 | 0190071 |
有向圖--理論、算... | 2018-2019 | 春學期 | 36 | 2 | 0190178 |
研究方向
運籌學
圖論與網路及其套用
學術成果
[1] 顏謹 and馬富紅. An improvement of Lichiardopol's theorem on disjoint cycles in tournaments.Applied Mathematics and Computation (New York),347,162,2019.
[2] 顏謹 and馬富紅. The confirmation of a conjecture on disjoint cycles in a graph.Discrete Mathematics,341,2903,2018.
[3] 顏謹 ,任燕燕 Degree sum conditions on two disjoint cycles in graphs.information processing letters,138,7,2018.
[4] 顏謹 Fan-type condition on disjoint cycles in a graph.Discrete Mathematics,341,1160,2018.
[5] 顏謹 and焦智慧. Disjoint cycles in graphs with distance degree sum conditions.Discrete Mathematics,340,1203,2017.
[6] 顏謹 and江素雲. Partial Degree Conditions and Cycle Coverings in Bipartite Graphs.Graphs and Combinatorics,33,955,2017.
[7] 顏謹 and江素雲. Vertex-disjoint copies of K-1,K-t in K-1,K-r-free graphs.Discrete Mathematics,340,649,2017.
[8] 顏謹 Disjoint directed triangles and quadrilaterals in directed graphs.UTILITAS MATHEMATICA,102,3,2017.
[9] 顏謹 Color degree and heterochromatic paths in edge-colored graphs.ARS Combinatoria,116,171,2014.
[10] XWFZR ,顏謹 and校外負責人. On 2-factors with cycles containing specified vertices in a bipartite graph.J Appl Math Comput.,31,203,2009.
[11] 顏謹 Disjoint triangles and quadrilaterals in a graph.Discrete Mathematics,308,3930,2008.
[12] 顏謹 Group connectivity in products of graphs.International Journal of Algebra,4,1185,2010.
[13] 顏謹 A Vertex cover with chorded 4-cycles.Acta Mathematica Sinica,27,2351,2011.
[14] 顏謹 Graph partition into small cliques.Discrete Applied Mathematics,162,322,2014.
[15] 顏謹 Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs.ARS Combinatoria,109,405,2013.
[16] 顏謹 On 2-Factors with chorded quadrilaterals in graphs.ARS Combinatoria,98,193,2011.
[17] XWFZR ,顏謹 and校外負責人. Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs.Graphs and Combinatorics,29,1337,2013.
[18] XWFZR ,顏謹 and校外負責人. Graph partition into K3s and K4s .J Appl Math. Comput,34,273,2010.
[19] 吳建良 ,XWFZR ,顏謹 Degree conditions for the partition of a graph into triangles and quadrilaterals .UTILITAS MATHEMATICA,86,341,2011.
[20] XWFZR ,顏謹 and校外負責人. Disjoint cycles and chorded cycles in graphs.Proceedings of The 2008 International Conference on Foundations of Computer Science (FCS'08),,9,2008.
[21] 顏謹 Contractible configurations on 3-flows in graphs satisfying the Fan-condition.European J. Combinatorics,34,892,2013.
[22] 吳建良 ,顏謹 Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t.Discrete Mathematics,310,2499,2010.
[23] 顏謹 ,劉桂真 Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph.J Appl Math Comput,27,23,2008.
[24] 顏謹 ,XWFZR Every 3-connected claw-free Z8-free graph is Hamiltonian.J. Graph Theory,64,1,2010.
[25] 顏謹 On Enomoto‘s problems in a bipartite graph.SCIENCE IN CHINA SERIES A-MATHEMATICS,52,1947,2009.
[26] 顏謹 ,劉桂真 On 2-factors with prescribed properties in a bipartite graph.Acta Mathematica Sinica-English Series,22,1115,2006.
[27] 顏謹 Nowhere-zero 3-flows and Z_3-connectivity of a family of graphs.Discrete Mathematics,311,1988,2011.
[28] 顏謹 New sufficient conditions for s-Hamiltonian graphs and s-Hamiltonian connected graphs.ARS Combinatoria,88,217,2008.
[29] 顏謹 ,XWFZR Integer exact network synthesis problem.SIAM J. Discrete Math.,23,136,2008.
[30] 顏謹 On 2-factors with cycles containing specified edges in a bipartite graph.Discrete Mathematics,309,1112,2009.
[31] 顏謹 An improved lower bound for a bi-criteria scheduling problem.Operations Research Letters,36,57,2008.
[32] 顏謹 On 2-factors with quadrilaterals containing specified vertices in a bipartite graph.ARS Combinatoria,82,133,2007.
[33] 顏謹 Disjoint cycles in directed graphs.ARS Combinatoria,136,21,2018.
[34] 顏謹 and江素雲. Disjoint cliques in claw-free graphs.ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,34,19,2018.
[35] 顏謹 and馬富紅. ON THE NUMBER OF DISJOINT 4-CYCLES IN REGULAR TOURNAMENTS.Discussiones Mathematicae Graph Theory,38,491,2018.
[36] XWFZR ,顏謹 and校外負責人. Disjoint small cycles in graphs.J Appl Math. Informatics,27,809,2009.
[37] 顏謹 and校外負責人. On 2-factors with cycles containing specified vertices in a bipartite graph.J Appl Math Comput.,31,203,2009.
[38] 顏謹 and校外負責人. Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs.Graphs and Combinatorics,29,1337,2013.
[39] 顏謹 and校外負責人. Graph partition into K3s and K4s .J Appl Math. Comput,34,273,2010.
[40] 顏謹 and吳建良. Degree conditions for the partition of a graph into triangles and quadrilaterals .UTILITAS MATHEMATICA,86,341,2011.
[41] 顏謹 and校外負責人. Disjoint cycles and chorded cycles in graphs.Proceedings of The 2008 International Conference on Foundations of Computer Science (FCS'08),,9,2008.
[42] 顏謹 and吳建良. Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t.Discrete Mathematics,310,2499,2010.
[43] 顏謹 and校外負責人. Disjoint small cycles in graphs.J Appl Math. Informatics,27,809,2009.
[44] 顏謹 and吳建良. Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t.Discrete Mathematics,310,2499,2010.
[45] 顏謹 and江素雲. Vertex-disjoint copies of K-1,K-t in K-1,K-r-free graphs.Discrete Mathematics,340,649,2017.
[46] 顏謹 and吳建良. Degree conditions for the partition of a graph into triangles and quadrilaterals .UTILITAS MATHEMATICA,86,341,2011.
[47] 顏謹 and焦智慧. Disjoint cycles in graphs with distance degree sum conditions.Discrete Mathematics,340,1203,2017.
[48] 顏謹 and校外負責人. On 2-factors with cycles containing specified vertices in a bipartite graph.J Appl Math Comput.,31,203,2009.
[49] 顏謹 and校外負責人. Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs.Graphs and Combinatorics,29,1337,2013.
[50] 顏謹 and校外負責人. Graph partition into K3s and K4s .J Appl Math. Comput,34,273,2010.
[51] 顏謹 and校外負責人. Disjoint cycles and chorded cycles in graphs.Proceedings of The 2008 International Conference on Foundations of Computer Science (FCS'08),,9,2008.
[52] 顏謹 and校外負責人. Disjoint small cycles in graphs.J Appl Math. Informatics,27,809,2009.
[53] 顏謹 and馬富紅. ON THE NUMBER OF DISJOINT 4-CYCLES IN REGULAR TOURNAMENTS.Discussiones Mathematicae Graph Theory,38,491,2018.
[54] 顏謹 and江素雲. Disjoint cliques in claw-free graphs.ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,34,19,2018.
[55] 顏謹 and馬富紅. The confirmation of a conjecture on disjoint cycles in a graph.Discrete Mathematics,341,2903,2018.
[56] 顏謹 and江素雲. Partial Degree Conditions and Cycle Coverings in Bipartite Graphs.Graphs and Combinatorics,33,955,2017.
[57] 顏謹. On Enomoto‘s problems in a bipartite graph.SCIENCE IN CHINA SERIES A-MATHEMATICS,52,1947,2009.
[58] 顏謹. New sufficient conditions for s-Hamiltonian graphs and s-Hamiltonian connected graphs.ARS Combinatoria,88,217,2008.
[59] 顏謹. On 2-factors with quadrilaterals containing specified vertices in a bipartite graph.ARS Combinatoria,82,133,2007.
[60] 劉桂真 and顏謹. On 2-factors with prescribed properties in a bipartite graph.Acta Mathematica Sinica-English Series,22,1115,2006.
[61] 顏謹. Disjoint triangles and quadrilaterals in a graph.Discrete Mathematics,308,3930,2008.
[62] 顏謹. On 2-factors with cycles containing specified edges in a bipartite graph.Discrete Mathematics,309,1112,2009.
[63] 顏謹. An improved lower bound for a bi-criteria scheduling problem.Operations Research Letters,36,57,2008.
[64] 顏謹. Color degree and heterochromatic paths in edge-colored graphs.ARS Combinatoria,116,171,2014.
[65] 顏謹. Graph partition into small cliques.Discrete Applied Mathematics,162,322,2014.
[66] 顏謹. Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs.ARS Combinatoria,109,405,2013.
[67] 顏謹. On 2-Factors with chorded quadrilaterals in graphs.ARS Combinatoria,98,193,2011.
[68] 顏謹. Contractible configurations on 3-flows in graphs satisfying the Fan-condition.European J. Combinatorics,34,892,2013.
[69] 劉桂真 and顏謹. Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph.J Appl Math Comput,27,23,2008.
[70] 顏謹. Nowhere-zero 3-flows and Z_3-connectivity of a family of graphs.Discrete Mathematics,311,1988,2011.
[71] 顏謹. Integer exact network synthesis problem.SIAM J. Discrete Math.,23,136,2008.
[72] 顏謹. Group connectivity in products of graphs.International Journal of Algebra,4,1185,2010.
[73] 顏謹. Every 3-connected claw-free Z8-free graph is Hamiltonian.J. Graph Theory,64,1,2010.
[74] 顏謹. A Vertex cover with chorded 4-cycles.Acta Mathematica Sinica,27,2351,2011.
[75] 任燕燕 and顏謹. Degree sum conditions on two disjoint cycles in graphs.information processing letters,138,7,2018.
[76] 顏謹. Fan-type condition on disjoint cycles in a graph.Discrete Mathematics,341,1160,2018.
[77] 顏謹. Disjoint cycles in directed graphs.ARS Combinatoria,136,21,2018.
[78] 顏謹. Disjoint directed triangles and quadrilaterals in directed graphs.UTILITAS MATHEMATICA,102,3,2017.
[79] Packing a number of copies of a $(p,\,q)$-graph.European Journal of Combinatorics,2018.
[80] Packing $k$ disjoint copies of $K_{1,4}$ in claw-free graphs.Graphs and Combinatorics,2018.
[81] An improvement of Lichiardopol's theorem on disjoint cycles in tournaments.Applied Mathematics and Computation,2018.
[82] Disjoint cycles on Lichiardopol’s conjecture in tournaments.The Electronic Journal of Combinatorics,2018.
[83] The confirmation of a conjecture on disjoint cycles in a graph.Discrete Mathematics,341,2903-2911,2018.
[84] Degree sum conditions on two disjoint cycles in graphs.Information Processing Letters,138,7-11,2018.
[85] Disjoint cliques in claw-free graphs.Acta Mathematicae Applicatae Sinica-English Series,34,19-34,2018.
[86] Vertex-disjoint copies of K1,t in K1,r-free graphs.Discrete Mathematics,340,649-654,2017.
[87] Disjoint cycles in a graph with distance degree sum conditions.Discrete Mathematics,340,1203-1209,2017.
[88] Vertex-disjoint copies of K1,3 in K1,r-free graphs.Discrete Mathematics,339,3085-3088,2016.
[89] Vertex-disjoint cycles containing specified vertices in a bipartite graph.Graph and Combinatorics,32,2171-2181,2017.
科研項目
[1] 圖上有限制條件的染色問題研究,2009/01/01,2011/12/31,
[2] 圖的匹配和染色,2014/08/15,2018/12/31,
[3] 網路分解與算法研究,2002/01/01,2004/12/31,
[4] 圖與網路技術在計算機科學中的套用,2007/01/01,2009/12/31,
[5] 圖的因子與因子分解,2005/01/30,2007/12/30,
[6] 圖的（g,f）-染色理論研究,2005/01/30,2007/12/30,
[7] 圖填裝和點不交的子圖問題,2016/08/17,2020/12/31,
[8] 圖的有限定條件的圈問題研究,2012/08/17,2016/12/31,
[9] 圖的k-流與群連通性質研究,2012/07/31,2015/07/31,
[10] 網路設計與圖的圈路問題研究,2007/01/01,2009/12/30,
[11] 教育部留學回國啟動基金,2008/01/01,2009/12/31,
[12] 圖的圈、2-因子和網路合成問題研究,2010/12/31,已結題,
榮譽獎項
獲2013山東大學教學成果獎一等獎（第四位）
獲2012山東省教學成果獎二等獎（第四位）
獲2004年山東高等學校優秀科研成果二等獎(第三位)
獲2004年山東省優秀博士學位論文獎（導師劉桂真教授）
