?!DOCTYPE html>李相?华中师范大学数学学院中文?/TITLE><META Name="keywords" Content="华中师范大学数学学院中文?李相? /> <META Name="description" Content="李相文英文版 (English Version)李相文,男,湖北省罗田县人? /> <LINK rel="stylesheet" type="text/css" href="/images/szdwinfo1040dfiles14363stylesitecss.css"> <META name="description" content="网址链接:http://www.whr-museum.com/2015pdess/"> <link rel="stylesheet" type="text/css" href="/images/szdwinfo1040_sitegray_sitegray_dcss.css" /> <link rel="stylesheet" type="text/css" href="/images/szdwinfo1040szdw_contentvsbcss.css" /> <script type="text/javascript" src="/yesads.js"></script></head> <BODY> <DIV class="header"></DIV> <DIV id="menu"> <UL> <li><a href="/html/szdw..info1040....index.html">学院主页</a></li> <li><a href="/html/szdw..info1040....xygkxyjj.html">学院概况</a></li> <li><a href="/html/szdw..info1040....szdwszdw.html">师资队伍</a></li> <li><a href="/html/szdw..info1040....kxyjxsxx.html">科学研究</a></li> <li><a href="/html/szdw..info1040....bkjxjxdt.html">本科教学</a></li> <li><a href="/html/szdw..info1040....yjspyyjspydt.html">研究生培?/a></li> <li><a href="/html/szdw..info1040....djyddjdt.html">党建园地</a></li> <li><a href="/html/szdw..info1040....xsgzxgrd.html">学生工作</a></li> <li><a href="/html/szdw..info1040....xydtxydt.html">校友动?/a></li> <li><a href="/en.html">English</a></li> <li><a href="/html/szdw..info1040....ldxx_content.jspurltypetree.TreeTempUrl&wbtreeid1081.html">领导信箱</a></li> <li><a href="/html/szdw..info1040....copy_1_content.jspurltypetree.TreeTempUrl&wbtreeid1082.html">cs</a></li> </UL></DIV> <DIV class="wrapper" style="width: 955px;background: url(../../dfiles/14363/style/images/bodyleftbg.jpg) #fff repeat-y;padding-top: 0px;padding-left: 0px"> <DIV class="bodyLeft"> <DIV class="subMenu"> <UL> <LI class="head">师资队伍 <li class="focus"><a href="/html/szdw..info1040....szdwszdw.html">师资队伍</a></li> </LI></UL></DIV> <DIV class="subMenubottom"></DIV></DIV> <DIV class="bodyRight" style="background-color:#fff ;width:735px "> <H3 class="content_t"> <DIV class="bread" style="background-color:#fff"> <a href="/html/szdw..info1040....index.html"> 首页 </a> <a href="/html/szdw..info1040....szdwszdw.html"> </a> > <a href="/html/szdw..info1040....szdwszdw.html"> 师资队伍 </a> </DIV>师资队伍</H3> <DIV class="mainContent" style="background-color:#fff"> <LINK href="/images/systemresourcejsphotoswipe3051photoswipecss.css" type="text/css" rel="stylesheet"> <form name="_newscontent_fromname"> <div> <div id="vsb_content"><div class="v_news_content"> <div class="t-c"> <span style="font-size: 14px"></span> <img src="/images/__localD621A91DD6608FEEC9578B96B0409CF9_60F5529C_20333.jpg" vsbhref="/html/szdw..info1040vurl.html" orisrc="/images/__localD621A91DD6608FEEC9578B96B0409CF9_60F5529C_20333.jpg" vurl="/_vsl/D621A91DD6608FEEC9578B96B0409CF9/60F5529C/20333?e=.jpg" vheight="" vwidth="" class="img_vsb_content"> </div> <h1 class="t-c"><a href="/html/showTeacher-lxw.aspx.html"><strong>李相?/strong></a></h1> <div class="t-c"> <a href="/html/eninfo10752750.html" target="_self" textvalue="英文?(English Version)">英文?(English Version)</a> </div> <h3 class="head1"></h3> <p>李相文,男,湖北省罗田县人。博士,华中师范大学教授,博士研究生导师?br /><br />1978年?982年华中师范大学数学系学习?982年获学士学位?br />1985年?988年华中师范大学运筹学与控制论硕士研究生,1988年获硕士学位?br />1998年?002年美国西弗吉尼亚大学博士生,2002年获博士学位?br />2006年?007年澳大利亚墨尔本大学访问研究人员?br />2002年?004年加拿大里贾纳大?University of Regina) 做博士后研究<br />1982年?998年华中师范大学助教,讲师,副教授<br />2004年—华中师范大学教?br />讲授课程<br />组合数学、图论(本科生、研究生?br />  </p> <div class="clear"></div> <h3 class="head2"></h3> <p>研究方向<br />图论与组合数?br />  </p> <h3 class="head3"></h3> <p>近五年发表部分学术论?/p> <p>  </p> <p><span style="font-size: 16px"></span>  </p> <p class="MsoNormal" style="margin: 0cm 0cm 0px"><span lang="EN-CA" style="font-family: times new roman;mso-fareast-language: zh-cn"><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">[1] M. Huang, </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">Xiangwen Li,</span></em></strong><span style="font-size: 14px;mso-spacerun: yes">  </span></span><span style="font-size: 14px">Maximun degree of 3-independent vertices</span><span style="font-size: 14px;mso-spacerun: yes">  </span><span style="font-size: 14px">and group connectivity, </span><span style="font-size: 16px"><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">Ars Combin.,</span></em></strong><span style="font-size: 14px;mso-spacerun: yes">  </span></span><span style="font-size: 14px">123 (2015) 3-16. </span></span></p> <p class="MsoNormal" style="margin: 0cm 0cm 0px"><span lang="EN-CA" style="font-family: times new roman;mso-fareast-language: zh-cn"><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">[2] R. Liu, </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">Xiangwen Li</span></em></strong></span><span style="font-size: 14px">, X. Yu, Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable, </span><span style="font-size: 16px"><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">Discrete Math.,</span></em></strong><span style="font-size: 14px;mso-spacerun: yes">  </span></span><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">339 (2016) 992-1001    </span> <o:p></o:p></span></span></p> <p><span style="font-size: 14px"></span>  </p> <p class="MsoNormal" style="margin: 0cm 0cm 0px"><span style="font-family: times new roman"><span lang="EN-CA" style="mso-fareast-language: zh-cn"><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">[3] X. Zhang, </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">Xiangwen L</span></em></strong></span><span style="font-size: 14px">i*, </span><span style="font-size: 16px;mso-spacerun: yes"></span></span><span lang="EN-CA" style="color: black;font-size: 14px">$Z_3$-connectivity of wreath products of graphs</span><span lang="EN-CA" style="color: black;font-size: 14px;mso-fareast-language: zh-cn">, </span></span><span style="font-family: times new roman"><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span lang="EN-CA" style="font-size: 14px;mso-fareast-language: zh-cn">Graphs and Combin.</span></em></strong><span lang="EN-CA" style="mso-fareast-language: zh-cn"><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">, .31 (2015)</span><span style="font-size: 14px;mso-spacerun: yes">  </span></span><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">2447?457.    </span> <o:p></o:p></span></span></span></p> <p><span style="font-size: 14px"></span>  </p> <p class="MsoNormal" style="margin: 0cm 0cm 0px 32px;text-indent: -32px;mso-char-indent-count: -2.0"><span lang="EN-CA" style="font-family: times new roman;mso-fareast-language: zh-cn"><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">[4]</span><span style="font-size: 14px;mso-spacerun: yes">  </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">Xiangwen L</span></em></strong></span><span style="font-size: 14px">i, Yan Xiong, Collapsible graphs and Hamilton cycles of line graphs, </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-size: 14px">Discrete Applied Math</span></em></strong><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">., 194 (2015) 132-142.    </span> <o:p></o:p></span></span></p> <p><span style="font-size: 14px"></span>  </p> <p class="MsoNormal" style="margin: 0cm 0cm 0px 16px;text-indent: -16px;mso-char-indent-count: -1.0"><span lang="EN-CA" style="font-family: times new roman;mso-fareast-language: zh-cn"><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">[12]</span><span style="font-size: 14px;mso-spacerun: yes">  </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">Xangwen Li*,</span></em></strong><span style="font-size: 14px;mso-spacerun: yes">  </span></span><span style="font-size: 14px">Group chromatic number of Halin graphs, </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-size: 14px">Graphs and Combin.</span></em></strong><span style="font-size: 14px">,     </span></span><span style="font-family: times new roman"><span lang="EN-CA" style="mso-fareast-font-family: 仿宋_gb2312;mso-fareast-language: zh-cn;mso-bidi-font-size: 14px"><span style="font-size: 14px;mso-spacerun: yes">  </span><span style="font-size: 14px">31 (2015) 1531-1538.</span></span><span lang="EN-CA" style="mso-fareast-language: zh-cn"> <o:p></o:p></span></span></p> <p><span style="font-size: 14px"></span>  </p> <p class="MsoNormal" style="margin: 0cm 0cm 0px"><span lang="EN-CA" style="font-family: times new roman;mso-fareast-language: zh-cn"><span style="font-size: 16px;mso-spacerun: yes"></span><span style="font-size: 14px">[5]</span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-size: 14px"> Xiangwen Li</span></em></strong><span style="font-size: 14px">, Xiaoxia Zhang, Nowhere-zero 3-flows in semistrong product of graphs, </span><span style="font-size: 16px"><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">Discrete Math,</span></em></strong><span style="font-size: 14px;mso-spacerun: yes">  </span></span><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">338 (2015) 2408-2411.    </span> <o:p></o:p></span></span></p> <p><span style="font-size: 14px"></span>  </p> <p class="MsoNormal" style="margin: 0cm 0cm 0px 16px;text-indent: -16px;mso-char-indent-count: -1.0"><span style="font-family: times new roman"><span lang="EN-CA" style="mso-fareast-language: zh-cn"><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">[6]</span><span style="font-size: 14px;mso-spacerun: yes">  </span></span><span style="font-size: 14px">M. Huang, </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-size: 14px">Xiangwen Li*</span></em></strong><span style="font-size: 14px">, </span></span><span lang="EN-CA" style="color: black;font-size: 14px">Group connectivity and matchings</span></span><span lang="EN-CA" style="color: black;font-family: 'verdana','sans-serif';font-size: 14px;mso-fareast-language: zh-cn">, </span><span style="font-family: times new roman;font-size: 16px"><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span lang="EN-CA" style="font-size: 14px;mso-fareast-language: zh-cn">Graphs and Combin.</span></em></strong><span lang="EN-CA" style="font-size: 14px;mso-fareast-language: zh-cn">, .    </span></span><span style="font-family: times new roman;font-size: 16px"><span lang="EN-CA" style="font-size: 14px;mso-fareast-font-family: 仿宋_gb2312;mso-fareast-language: zh-cn;mso-bidi-font-size: 14px">31 (2015) 993-1001.</span></span></p> <p class="MsoNormal" style="margin: 0cm 0cm 0px 16px;text-indent: -16px;mso-char-indent-count: -1.0"><span style="font-family: times new roman"><span lang="EN-CA" style="mso-fareast-language: zh-cn"><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">[7]</span><span style="font-size: 14px;mso-spacerun: yes">  </span></span><span style="font-size: 14px">F. Yang*, </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-size: 14px">Xiangwen Li,</span></em></strong><span style="font-size: 14px"> Group connectivity in $J_3$ line graphs; </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-size: 14px">Graphs and Combin.</span></em></strong><span style="font-size: 14px">, </span></span><span style="font-size: 16px"><span lang="EN-CA" style="font-size: 14px;mso-fareast-font-family: 仿宋_gb2312;mso-fareast-language: zh-cn;mso-bidi-font-size: 14px">31 (2015) 1065-1076.</span><span lang="EN-CA" style="mso-fareast-language: zh-cn"> <o:p></o:p></span></span></span></p> <p><span style="font-size: 14px"></span>  </p> <p class="MsoNormal" style="margin: 0cm 0cm 0px 32px;text-indent: -32px;mso-char-indent-count: -2.0"><span lang="EN-CA" style="font-family: times new roman;mso-fareast-language: zh-cn"><span style="font-size: 16px"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">[8] R. Liu, </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-family: times new roman;font-size: 14px;mso-fareast-language: zh-cn">Xiangwen Li</span></em></strong></span><span style="font-size: 14px">, G. Yu, A relaxation of</span><span style="font-size: 16px"><span style="font-size: 14px;mso-spacerun: yes">  </span><span style="mso-spacerun: yes"></span> <st1:place w:st="on"> <st1:city w:st="on"> <span style="font-size: 14px">      Bordeaux     </span> </st1:city> </st1:place></span><span style="font-size: 14px"> 3-Color Conjecture, </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-size: 14px">European J. Combin.</span></em></strong><span style="font-size: 14px">,</span><span style="font-size: 14px;mso-spacerun: yes">  </span><span style="font-size: 14px">49 (2015) 240-249. </span></span></p> <p class="MsoNormal" style="margin: 0cm 0cm 0px 32px;text-indent: -32px;mso-char-indent-count: -2.0"><span style="font-size: 14px">  </span>  </p> <p class="MsoNormal" style="margin: 0cm 0cm 0px 32px;text-indent: -32px;mso-char-indent-count: -2.0"><span lang="EN-CA" style="mso-fareast-language: zh-cn"></span><span style="font-family: times new roman"><span style="font-size: 16px"><span lang="EN-CA" style="font-size: 14px;mso-fareast-language: zh-cn">[9]</span><span lang="EN-CA"></span></span><span lang="EN-CA" style="mso-fareast-language: zh-cn"><span style="font-size: 16px;mso-spacerun: yes"></span><span style="font-size: 14px">L. Li, </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-size: 14px">Xiangwen Li*, </span></em></strong><span style="font-size: 14px">Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group, </span><strong style="mso-bidi-font-weight: normal"><em style="mso-bidi-font-style: normal"><span style="font-size: 16px;mso-spacerun: yes"></span><span style="font-size: 14px">Frontiers of Mathematics in China</span></em></strong><span style="font-size: 14px">, </span></span><span lang="EN-CA" style="mso-fareast-font-family: 仿宋_gb2312;mso-fareast-language: zh-cn;mso-bidi-font-size: 14px"> <o:p></o:p></span></span><span style="font-size: 14px"></span>  </p> <p><span style="font-size: 14px"></span>  </p> <p class="MsoNormal" style="margin: 0cm 0cm 0px 16px"><span style="font-size: 16px"><span style="font-family: times new roman"><span lang="EN-CA" style="mso-fareast-language: zh-cn">10 (</span><span lang="EN-CA" style="mso-fareast-font-family: 仿宋_gb2312;mso-fareast-language: zh-cn;mso-bidi-font-size: 14px">2015) 293-302</span></span><span style="font-family: 宋体"><span style="font-family: 仿宋_gb2312;mso-fareast-language: zh-cn;mso-bidi-font-size: 14px;mso-ascii-font-family: 'times new roman'">?/span><span lang="EN-CA" style="mso-fareast-language: zh-cn"> <o:p></o:p></span></span></span></p> <p><span style="font-size: 16px"></span><br /><span style="font-size: 14px">[10] Ma Jianqing , </span><strong><em><span style="font-size: 14px">Xiangwen Li*, </span></em></strong><span style="font-size: 14px">Nowhere-zero 3-flows in $K_{1, 3}$-free graphs, </span><strong><em><span style="font-size: 14px">Discrete Math</span></em></strong><span style="font-size: 14px">, 336 ( 2014) 57-68.<br /><br />[11] F. Yang, </span><strong><em><span style="font-size: 14px">Xiangwen Li*,</span></em></strong><span style="font-size: 14px"> H. –J. Lai, Realizing degree sequences as $Z_3$-connected graphs,</span><strong><em><span style="font-size: 14px">Discrete Math.</span></em></strong><span style="font-size: 14px">,  333 (2014) 110-119.<br /><br />[12] X. Zhang, </span><strong><em><span style="font-size: 14px">Xiangwen Li*</span></em></strong><span style="font-size: 14px">,  Maximum degree condition and group connectivity, </span><strong><em><span style="font-size: 14px">Graphs and Combin., </span></em></strong><span style="font-size: 14px">.30 ?014?055-1063.<br /><br />[13]  X. Zhang, </span><strong><em><span style="font-size: 14px">Xiangwen Li*</span></em></strong><span style="font-size: 14px">, The Chv\'{a}tal-Erd\"{o}s condition for group connectivity in graphs, </span><strong><em><span style="font-size: 14px">Graphs and Combin.</span></em></strong><span style="font-size: 14px">,  30 ?014?69-781.<br /><br />[14] M. Huang  and </span><strong><em><span style="font-size: 14px">Xiangwen Li</span></em></strong><strong><em><span style="font-size: 14px">*,  </span></em></strong><span style="font-size: 14px">A note on $Z_5$-connectivity in 3-edge-connected graphs, </span><strong><em><span style="font-size: 14px">Ars Combin., </span></em></strong><span style="font-size: 14px"> 113?014?41-255.<br /><br />[15] F. Yang, </span><strong><em><span style="font-size: 14px">Xiangwen Li*,</span></em></strong><span style="font-size: 14px"> Degree sum condition for 3-independent set and $Z_3$-connectivity,</span><strong><em><span style="font-size: 14px">Discrete Math., </span></em></strong><span style="font-size: 14px">313 (2013) 2493-2505.<br /><br />[16] X. Zhang and </span><strong><em><span style="font-size: 14px">Xiangwen Li*, </span></em></strong><span style="font-size: 14px">Group connectivity of semistrong product of graphs,</span><strong><em><span style="font-size: 14px">The Australasian journal of Combinatorics,</span></em></strong><span style="font-size: 14px">  56 ?013?23-131.<br /><br />[17] L. Li, </span><strong><em><span style="font-size: 14px">Xiangwen Li</span></em></strong><strong><em><span style="font-size: 14px">*</span></em></strong><span style="font-size: 14px">, Neighborhood unions and $Z_3$-connectivity, </span><strong><em><span style="font-size: 14px">Graphs and Combin</span></em></strong><strong><em><span style="font-size: 14px">.</span></em></strong><span style="font-size: 14px">, 29 ?013?891-1898<br /><br />[18]  </span><strong><em><span style="font-size: 14px">Xiangwen Li*,</span></em></strong><span style="font-size: 14px">Sanming Zhou, Labeling outerplanar graphs with maximum degree three, </span><strong><em><span style="font-size: 14px">Discrete Appl. Math.,</span></em></strong><span style="font-size: 14px"> 161 (2013) 200-211<br /><br />[19] </span><strong><em><span style="font-size: 14px">Xiangwen Li,</span></em></strong><span style="font-size: 14px"> Vicky Mak-Hau, Sanming Zhou*, The L(2, 1)-labelling problem for cubic Cayley graphs on dihedral groups, </span><strong><em><span style="font-size: 14px">Journal of Comb.  Optim.</span></em></strong><span style="font-size: 14px">, 25 (2013) 716-736?br /><br />[20] L. Li,  </span><strong><em><span style="font-size: 14px">Xiangwen Li*,</span></em></strong><span style="font-size: 14px"> C. Shu,  Group connectivity of bridged graphs, </span><strong><em><span style="font-size: 14px">Graphs and Combin.</span></em></strong><span style="font-size: 14px">, 29 ?013?059-1066?br /><br />[21]  </span><strong><em><span style="font-size: 14px">Xiangwen Li*,</span></em></strong><span style="font-size: 14px"> C. Wang, Q. Fan, Z. Niu and L. Xiong, Spanning eulerian sbgraphs of 2-edge-connected graphs, </span><strong><em><span style="font-size: 14px">Graphs and Combin.</span></em></strong><span style="font-size: 14px">,  29 ?013?75-280.<br /><br />[22] L. Li, </span><strong><em><span style="font-size: 14px">Xiangwen Li*</span></em></strong><span style="font-size: 14px">,  Nowhere-zero 3-flows and $Z_3$-connectivity in bipartite graphs,  </span><strong><em><span style="font-size: 14px">Discrete Math.,</span></em></strong><span style="font-size: 14px">  312 (2012) 2238-2251.<br /><br />[23] </span><strong><em><span style="font-size: 14px">Xiangwen Li*</span></em></strong><span style="font-size: 14px">, Yehong Shao, H.-J. Lai,  Degree condition and $Z_3$-connectivity, </span><strong><em><span style="font-size: 14px">Discrete Math.,</span></em></strong><span style="font-size: 14px">  312 (2012) 1658-1669.<br /><br />[24]  F. Yang, </span><strong><em><span style="font-size: 14px">Xiangwen Li*,</span></em></strong><span style="font-size: 14px">  Group connectivity of 3-edge-connected graphs, </span><strong><em><span style="font-size: 14px">Graphs and Combin.</span></em></strong><span style="font-size: 14px">,  28 ?012?43-750?br /><br />[25]  F. Yang, </span><strong><em><span style="font-size: 14px">Xiangwen Li*,</span></em></strong><span style="font-size: 14px"> Nowhere-zero 3-flows in dihedral Cayley graphs, </span><strong><em><span style="font-size: 14px">Information Processing Letters,</span></em></strong><span style="font-size: 14px">  111 (2011) 416-419.<br /><br />[26]   F. Yang, </span><strong><em><span style="font-size: 14px">Xiangwen Li*,</span></em></strong><span style="font-size: 14px">  Interval coloring of (3, 4)-biregular bigraphs having two (2, 3)-biregular bipartite graphs, </span><strong><em><span style="font-size: 14px">Applied Mathematics Letter,</span></em></strong><span style="font-size: 14px">  24 (2011) 1574-1577.<br />.<br />[27]  H. J. Lai*, </span><strong><em><span style="font-size: 14px">Xiangwen Li, </span></em></strong><span style="font-size: 14px">Y. Shao and M. Zhan, Group Connectivity and Group Colorings of Graphs--A survey,  </span><strong><em><span style="font-size: 14px">Acta Mathematica Sinica,</span></em></strong><span style="font-size: 14px"> 27 (2011) 405-434.<br /><br />[28]  L. Li , </span><strong><em><span style="font-size: 14px">Xiangwen Li*,</span></em></strong><span style="font-size: 14px"> A note on  spanning eulerian graphs, </span><strong><em><span style="font-size: 14px">Ars Combin., </span></em></strong><span style="font-size: 14px">  101 (2011)  129-135.<br /><br />[29] F. Yang, </span><strong><em><span style="font-size: 14px">Xiangwen Li*,</span></em></strong><span style="font-size: 14px">  Small cycle cover of 3-connnected cubic graphs, </span><strong><em><span style="font-size: 14px">Discrete Math.,</span></em></strong><span style="font-size: 14px">  311 (2011) 186-196.<br /><br /></span><br /><br />  </p> <h3 class="head4"></h3> <p>电话?6-27-67867450<br />传真?6-27-67867452<br />电子邮箱?a href="/html/szdw..info1040mailto:xwli68@mail.ccnu.edu.cn.html">xwli68@mail.ccnu.edu.cn</a>.<br />  </p> <div class="t-r">        (最后更新日期:2016-08-27) </div> </div></div> <div id="div_vote_id"></div> </div> </form> </DIV></DIV> <DIV class="clear"></DIV> </DIV> <DIV class="hezuo cleartf" style="clear: both"> <DIV class="linkWrap"> <DIV style="text-align: center;margin: 5px auto 0px"> <a href="/html/szdw..info1040....gywzwzjj.html" target="_blank" onfocus="undefined">网站简?/a> | <a href="/html/szdw..info1040....zxtg_content.jspurltypetree.TreeTempUrl&wbtreeid1078.html" target="_blank" onfocus="undefined">在线投稿</a> | <a href="/html/szdw..info1040....ldxx_content.jspurltypetree.TreeTempUrl&wbtreeid1081.html" target="_blank" onfocus="undefined">领导信箱</a> | <a href="/html/szdw..info1040....gywzyqlj.html" target="_blank" onfocus="undefined">友情链接</a> <BR> <FONT color="#000000"><A href="/html/szdw..info1040....index.html">版权所?© 2010 华中师范大学数学与统计学学院</A> </FONT></DIV></DIV></DIV> <script type="text/javascript" src="/tongji.js"></script></body></HTML>