姓名：王应前
职称：教授
所在学院：数理与信息工程学院
研究方向：图的连通性和图的染色理论
主讲课程：主讲本科课程：数学分析
指导专业：（0701） 数学（一级）
科研项目（课题）1．参与国家自然科学基金面上项目3项，省自然科学基金面上项目1项。
2．主持省教育厅自然科学基金重点项目一项： 项目名称：可平面图的3可选择性研究与应用 项目编号：20070441 研究日期：2008.1-2009.12（已结题）
3．主持省自然科学基金面上项目一项： 项目名称：平面图的3染色和全染色 项目编号：Y6090699 研究日期：2010.1-2010.12 （进行中）
论文著作1．In Science China 1．Yingqian Wang, Qijun Zhang, On 3-choosability of triangle-free plane graphs, Science China Mathematics, 2011，Accepted.
2．WANG YingQian, MAO XiangHua, Lu HuaJing & Wang WeiFan, On 3-colorability of planar graphs without adjacent short cycles, Science China Mathematics, April 2010 Vol.53 No.4: 1129-1132.
3 SHEN Lan & WANG YingQian, Total colorings of planar graphs with maximum degree at least 8, Science in China series A: Mathematics, Aug., 2009, Vol．52, No．8, 1733-1742.
4 Ying-qian WANG, Min-le SHANGGUAN & Qiao LI, On total chromatic number of planar graphs without 4-cycles, Science in China series A: Mathematics, Jan., 2007, Vol．50, No．1, 81-86.
5 WANG Yingqian, Optimization problems of the third edge-connectivity of graphs, Science in China: Series A Mathematics, 2006 Vol.49 No.6 791-799.
6 WANG Yingqian & LI Qiao, Upper bound of the third edge-connectivity of graphs, Science in China Ser．A Mathematics, 2005 Vol．48 No．3 360-371.
In Discrete Mathematics 1．Yingqian Wang, Qijun Zhang, Decomposing a planar graph with girth at least 8 into a forest and a matching, Discrete Math., 2011, accepted
2 Yingqian Wang, Huajing Lu, Ming Chen, Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable, Discrete Math., 310 （2010） 147-158.
3 Lan Shen, Yingqian．Wang, Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable, Discrete Math., 310 （2010） 321-324.
4 Huajing Lu, Yingqian Wang, Weifan Wang et al., On the 3-colorability of planar graphs without 4-, 7- and 9-cycles, Discrete Math., 309 （2009） 4596-4607.
5 Yongzhu Chen, Yingqian Wang, On the diameter of generalized Kneser graphs, Discrete Math., 308 （2008） 4276-4279.
6 Yingqian Wang, Ming Chen, Liang Shen, Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable, Discrete Math., 308 （2008） 4014-4017.
7 Ying Qian Wang, Super restricted edge-connectivity of vertex-transitive graphs, Discrete Math., 289 （2004） 199-205.
In Information Processing Letters1．Jingwen Zhang, Yingqian Wang, （-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles, Inform．Process．Lett., 110 （2010） 830-834.
2．Yingqian Wang, Huajing Lu, Ming Chen, A note on 3-choosability of planar graphs．Inform．Process．Lett., 105 （2008） 206-211.
3．Mickael Montassier, Andre Raspaud, Weifan Wang, Yingqian Wang, A relaxation of Havel’s 3-color problem, Inform．Process．Lett., 107 （2008） 107-109.
4．Liang Shen, Yingqian Wang, A sufficient condition for a planar graph to be 3-choosable, Inform．Process．Lett., 104 （2007） 146-151.
In Others1．Yingqian Wang, Qian Wu, Liang Shen, Planar graphs without cycles of length 4, 7, 8 or 9 are 3-choosable, Discrete Applied Math．159 （2011） 232-239.
2．Dingzhu Du, Lan Shen, Yingqian Wang, Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable, Discrete Applied Mathematice, 157 （2009） 2778-2784.
3．Lan Shen, Yingqian Wang, Weifan Wang, Ko-Wei Lih, On the 9-total colorability of planar graphs with maximum degree 8 and without intersecting triangles, Applied Mathematics Letters, 22 （2009） 1369-1373.
4．Lan Shen, Yingqian Wang, On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles, Graphs and Combinatorics , （2009） 25: 401-407.
5．Huiyu Sheng, Yingqian Wang, A structural theorem of planar graphs with some applications, Discrete appl．Math．2011, accepted subject to minor revesion.
指导研究生简况1．2003级1人，上官敏乐，获浙江省优秀硕士学位论文，发表SCI论文1篇；
2．2004级1人，杨根尚；
3．2005级2人，沈亮，陈明，共发表SCI论文5篇；
4．2006级3人，沈岚，陆华晶，郭宏斌，共发表SCI论文9篇；其中沈岚获校优秀硕士学位论文；
5．2007级3人，章齐君，毛向花，陶鑫，已发表SCI论文4篇；其中毛向花获校优秀硕士学位论文；
6．2008级3人，盛慧玉，姚潇彦，张静雯；
7．2009级3人，吴倩，卢秋丽，盛平；
8．2010级2人，徐灵姬，亢莹利。
*如果发现导师信息存在错误或者偏差，欢迎随时与我们联系，以便进行更新完善。
请记住我们的网址：www.js-zs.org
（责任编辑：admin）
