浙师大数理与信息工程学院导师介绍：金泽民

　　姓名：金泽民　
　　职称：副教授　
　　所在学院：数理与信息工程学院　

　　研究方向：图论与组合最优化
　　主讲课程：主讲本科课程： 《组合数学与图论》，《图论》
　　指导专业：（0701） 数学（一级）

　　科研项目（课题）
　　主持一项国家自然科学基金青年基金项目：边染色图的单色子图和杂色子图划分问题（10701065）， 已结题。

　　论文著作
　　1．Jin, Zemin; Li, Xueliang Partitioning Complete Graphs by Heterochromatic Trees Acta Math. Appl. Sin. Engl. Ser. 28（2012）, no. 4, 625-630.
　　2．Jin, Zemin; Wen, Shili; Zhou, Shujun Heterochromatic tree partition problem in complete tripartite graphs. Discrete Math. 312 （2012）, no. 4, 789–802.
　　3．Jin, Zemin; Zhu, Peipei; Liang, Xiaoying Maximal independent sets without including any leaves in trees. Int．J. Contemp. Math. Sci. 6 （2011）, no. 21-24, 1159–1165.
　　4．Jin, Zemin; Liang, Xiaoying; Liu, Xuezi Maximal independent sets in trees with large maximum degree. Util. Math. 80 （2009）, 225--231.
　　5．Jin, Zemin; Yan, Sherry H. F. Trees with the second and third largest number of maximal independent sets. Ars Combin. 93 （2009）, 341--351.
　　6．Jin, Zemin; Yan, Sherry H. F. The second largest number of maximal independent sets in graphs with at most $k$ cycles. Taiwanese J. Math. 13 （2009）, no. 5, 1397--1410.
　　7．Jin, Zemin.; Li, Xueliang Anti-Ramsey Numbers for Graphs with Independent Cycles. Electron．J. Combin. 16 （2009）, no. 1, #R85.
　　8．Yan, Sherry H. F.; Jin, Zemin Integers for the number of maximal independent sets in graphs. Int．J. Contemp. Math. Sci. 4 （2009）, no. 1-4, 47--55.
　　9．Li, Xueliang; Tu, Jianhua; Jin, Zemin Bipartite rainbow numbers of matchings. Discrete Math. 309 （2009）, no. 8, 2575--2578.
　　10．Ye, Lin; Jin, Zemin; Bu, Yuehua On the $L（2,1）$-labelling of cacti．J. Math. Study 41 （2008）, no. 4, 371--383.
　　11．Jin, Zemin; Li, Xueliang Graphs with the second largest number of maximal independent sets. Discrete Math. 308 （2008）, no. 23, 5864--5870.
　　12．Chen, He; Jin, Zemin; Li, Xueliang; Tu, Jianhua Heterochromatic tree partition numbers for complete bipartite graphs. Discrete Math. 308 （2008）, no. 17, 3871--3878.
　　13．Jin, Ze-min; Li, Xueliang Vertex partitions of $r$-edge-colored graphs. Appl. Math．J. Chinese Univ. Ser. B 23 （2008）, no. 1, 120--126.
　　14．Jin, Zemin; Yan, Huifang; Yu, Qinglin Generalization of matching extensions in graphs. II. Discrete Appl. Math. 155 （2007）, no. 10, 1267--1274.
　　15．Jin, Zemin; Yu, Xingxing; Zhang, Xiaoyan Contractible subgraphs in $k$-connected graphs．J. Graph Theory 55 （2007）, no. 2, 121--136.
　　16．Huang, Xiaolong; Jin, Zemin; Yu, Xingxing; Zhang, Xiaoyan Contractible cliques in $k$-connected graphs. Graphs Combin. 22 （2006）, no. 3, 361--370.
　　17．Jin, Zemin; Kano, Mikio; Li, Xueliang; Wei, Bing Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees．J. Comb. Optim. 11 （2006）, no. 4, 445--454.
　　18．Jin, Zemin; Li, Xueliang On the $k$-path cover problem for cacti. Theoret. Comput. Sci. 355 （2006）, no. 3, 354--363.
　　19．Jin, Zemin; Li, Xueliang The complexity for partitioning graphs by monochromatic trees, cycles and paths. Int．J. Comput. Math. 81 （2004）, no. 11, 1357--1362.
　　20．Jin, Zemin; Li, Xueliang On a conjecture on $k$-walks of graphs. Australas．J. Combin. 29 （2004）, 135--142.

　　指导研究生简况
　　1．已毕业3名
　　2．在读3名

　　*如果发现导师信息存在错误或者偏差，欢迎随时与我们联系，以便进行更新完善。联系方式