您好,欢迎访问北京理工大学机构知识库!
所在位置: 首页 - 学者导航
相关导航
按重要数据库分组
  • 任何
  • 15 SCIE
  • 3 EI工程索引(美)
  • 11 Scopus文摘索引数据库(荷)
  • 更多
按类型分组
  • 任何
  • 17 学位论文
  • 16 期刊
  • 更多
按语种分组
  • 任何
  • 18 中文
  • 15 外文
优秀人才
  • 任何
年代
  • 任何
  • 1 2025
  • 2 2024
  • 5 2023
  • 6 2022
  • 2 2021
  • 2 2016
  • 1 2015
  • 2 2014
  • 2 2011
  • 2 2010
  • 6 2000-2009
按来源期刊分组
  • 任何
  • 9 硕士
  • 7 博士
  • 2 Journal of ..
  • 2 AXIOMS
  • 1 Discrete Ap..
  • 更多

熊黎明

  • 职称:正高级
  • 研究方向:应用数学/图论
  • 所属院系:数学与统计学院  
  • 成果数量:33条,属于本单位的个人成果33条

条数据
导出

作者: Chen, Xiaodong1;Zhang, Jiayuan1;Xiong, Liming2;Su, Guifu31Liaoning Normal Univ, Sch Math, Dalian 116029, Peoples R China.;2Beijing Inst Technol, Sch Math & Stat, Beijing Key Lab MCAACI, Beijing 100081, Peoples R China.;3Beijing Univ Chem Technol, Coll Math & Phys, Beijing 100029, Peoples R China.)

出处: DISCRETE APPLIED MATHEMATICS 2025 Vol.360 P51-64

关键词: INDEPENDENT SPANNING-TREES; HAMILTON SUFFICIENT CONDITION

摘要: If a graph G contains two spanning trees T 1 , T 2 such that for each two distinct vertices x, , y of G, , the (x, x , y )-path in each T i has no com ...

作者: NIU Zhao-hong1;,XIONG Li-ming2;,YANG Wei-hua3; (1School of Mathematical Sciences, Shanxi University;2School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology;3Department of Mathematics, Taiyuan University of Technology)

出处: Applied Mathematics:A Journal of Chinese Universities 2024 第39卷 第2期 P239-252

关键词: iterated line graph;traceable;hamiltonian index;hamiltonian path index

摘要: Xiong and Liu [21] gave a characterization of the graphs G for which the n-iterated line graph Ln(G) is hamiltonian, for n ≥ 2. In this pap ...

作者: Niu,Zhao-Hong1;Xiong,Li-Ming2;Yang,Wei-Hua3; (1School of Mathematical Sciences, Shanxi University, Taiyuan, 030006, China;2School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing, 100081, China;3Department of Mathematics, Taiyuan University of Technology, Taiyuan, 030024, China)

出处: Applied Mathematics 2024 Vol.39 No.2 P239-252

摘要: Xiong and Liu [21] gave a characterization of the graphs G for which the n-iterated line graph Ln(G) is hamiltonian, for n ≥ 2. In this paper, we stud ...

作者: Yibin Fang;Liming Xiong (1School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100081, PR China;2Center for Combinatorics and LPMC Nankai University, Tianjin 300071, PR China;3School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing 100081, PR China)

出处: Discrete Applied Mathematics 2023 Vol.325 P43-51

关键词: Iterated line graph;Dominating cycle;Dominating induced cycle

摘要: In this paper, we give characterizations of graphs with line graphs or iterated line graphs that have dominating cycles. The characterization of graph ...

作者: Xia Liu;Zdeněk Ryjáček;Petr Vrána;Liming Xiong;Xiaojing Yang (School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing, P.R. China School of Mathematics and Statistics, Northwestern Polytechnical University, Xi\'an, Shaanxi, P.R. China Department of Mathematics, European Centre of Excellence NTIS - New Technologies for the Information Society, University of West Bohemia, Pilsen, Czech Republic Department of Mathematics, European Centre of Excellence NTIS - New Technologies for the Information Society, University of West Bohemia, Pilsen, Czech Republic School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing, P.R. China School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing, P.R. China School of Mathematics and Statistics, Henan University, Kaifeng, P.R. China)

出处: Journal of Graph Theory 2023 Vol.102 No.1 P154-179

关键词: claw-free;closure;forbidden subgraph;Hamilton-connected;net-free

摘要: This is the first one in a series of two papers, in which we complete the characterization of forbidden generalized nets implying Hamilton-connectedne ...

作者: Zhang, Lei1;Xiong, Liming1;Tu, Jianhua21Beijing Inst Technol, Sch Math & Stat, Beijing Key Lab MCAACI, Beijing 100081, Peoples R China.;2Beijing Technol & Business Univ, Sch Math & Stat, Beijing 100048, Peoples R China.)

出处: GRAPHS AND COMBINATORICS 2023 Vol.39 No.5

关键词: EXISTENCE

摘要: Given a graph G and X, Y ? V (G), d(G)(X, Y) is the distance between X and Y and the edge diameter diame(G) is the greatest distance between two edges ...

作者: Yang, Xiaojing1;Xiong, Liming21Henan Univ, Sch Math & Stat, Kaifeng 475004, Peoples R China.;2Beijing Inst Technol, Sch Math & Stat, Beijing Key Lab MCAACI, Beijing 100081, Peoples R China.)

出处: DISCUSSIONES MATHEMATICAE GRAPH THEORY 2023 Vol.43 No.1 P211-224

关键词: PROOF

摘要: Clearly, having a 2-factor in a graph is a necessary condition for a graph to be hamiltonian, while having an even factor in graph is a necessary con- ...

作者: Wang, Panpan1;Xiong, Liming2; (1School of Mathematics and Statistics, Beijing Institute of Technology, Beijing, 100081, China;2Beijing Key Laboratory on MCAACI, School of Mathematics and Statistics, Beijing Institute of Technology, Beijing, 100081, China)

出处: Graphs and Combinatorics 2023 Vol.39 No.4

摘要: A graph is called supereulerian if it has a spanning eulerian subgraph. A connected even [2, 2s]-factor of a graph G is a connected factor with all ve ...

作者: Du, Junfeng1,2;Huang, Ziwen3;Xiong, Liming4; (1 Beijing Inst Technol, Sch Math & Stat, Beijing 100081, Peoples R China. ;2 Beijing Univ Chem Technol, Dept Math, Beijing 100029, Peoples R China. ;3 Yichun Univ, Ctr Appl Math, Sch Math & Comp Sci, Yichun 336000, Peoples R China. ;4 Beijing Inst Technol, Sch Math & Stat, Beijing Key Lab MCAACI, Beijing 100081, Peoples R China.)

出处: AXIOMS 2022 Vol.11 No.5

关键词: SUFFICIENT CONDITIONS; EQUALITY

摘要: Let H be a class of given graphs. A graph G is said to be H-free if G contains no induced copies of H for any H is an element of H. In this article, w ...

作者: Shangguan, Yingmin1;Wang, Monica Mengyu1,2;Xiong, Liming1; (1 Beijing Inst Technol, Sch Math & Stat, Beijing Key Lab MCAACI, Beijing 100081, Peoples R China. ;2 Capital Normal Univ, Sch Math Sci, Beijing 100089, Peoples R China.)

出处: AXIOMS 2022 Vol.11 No.10

关键词: COLLAPSIBLE GRAPHS

摘要: The line graph L(G) of G has E(G) as its vertex set, and two vertices are adjacent in L (G) if and only if the corresponding edges share a common end ...

熊黎明正高级简介

Educational Background

  1. 1999--2001(Ph.D.), Dept. of Appl. Math., University of Twente, Enschede, The Kingdom of Netherlands.
  2. 1990--1993(M.Sc.), Dept. of Appl. Math., University of Science and Technology Beijing, Beijing.
  3. 1983--1987(B.Sc.), Dept. of Appl. Math., Jiangxi Normal University, Nanchang, Jiangxi.


Working Experience

  1. 06/2002--present, School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100081.
  2. 09/1993--05/2002, Department of Mathematics, Jiangxi Normal University, Nanchang, Jiangxi.
  3. 07/1987--08/1990, Department of Mathematics, Yichun University Yichun, Jiangxi.

Teachings

Undergraduate Course: Discrete Mathematics; Advanced Algebra; Data Structures; Higher Mathematics; Linear Algebra.

Master's Degree Students: Graph Theory with Applications; Graphs and Networks; Combinatorial Theory.

Ph.D. Students: Modern Graph Theory.

Publications

2017



​[83] Junfeng Du, Binglong Li and Liming Xiong, Forbidden pairs of disconnected graphs for traceability in connected graphs, Discrete Mathematics, 340 (2017) 2194-2199.


[82] Liming Xiong, Characterization of forbidden subgraphs for the existence of even factors in graphs, Discrete Applied Mathematics, 223 (2017) 135-139.


[81] Zhi-Hong Chen, Hong-Jian Lai and Liming Xiong, Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs, Journal of Combinatorial Theory, Series B, 122 (2017) 167-186.


[80] Shengmei Lv and Liming Xiong, Even factors with a bounded number of components in iterated line graphs, Science China Mathematics, 60 (2017) 177-188.


​[79] Shengmei Lv and Liming Xiong, Forbidden pairs for spanning (closed) trail, Discrete Mathematics, 340 (2017) 1012-1018.




​2016


[78] Shengmei Lv and Liming Xiong, Minimum Number of Components of 2-Factors in Iterated Line Graphs, Bull. Malays. Math. Sci. Soc., 39 (2016) 361–371.


​[77] Akira Saito and Liming Xiong, The Ryjacek closure and a forbidden subgraph, Discussiones Mathematicae Graph Theory,  36 (2016) 621-628.


[76] Mingqiang An and Liming Xiong, Extremal polyomino chains with respect to general Randić index, J. Comb. Optim., 31 (2016) 635–647.


[75] Binlong Li, Liming Xiong and Jun Yin, Large degree vertices in longest cycles of graphs, Discussiones Mathematicae Graph Theory, 36 (2016) 363–382.


[74] Jun Yin, Liming Xiong and Haixing Zhao, Hamiltonian claw-free graphs and o-heavy graphs involving induced cycles, Graphs and Combinatorics, 32 (2016) 823–833.


[73] Guifu Su, Liming Xiong, Xiaofeng Su and Guojun Li, Maximally edge-connected graphs and zeroth-order general Randić index for α≤−1, J. Comb. Optim., 31 (2016) 182–195.


​[72] Kindar Ch, Das, Guifu Su and Liming Xiong, Relation between degree distance and Gutman index of graphs, MATCH Commun. Math. Comput. Chem., 76 (2016) 221-232.


​[71] Guifu Su, Liming Xiong, Ivan Gutman and Lan Xu, Reciprocal product-degree distance of graphs, Filomat, 30 (2016) 2217-2231.



2015


[70] Jun Yin, Liming Xiong, Conditions for a graph to have a connected even [2, 2s]-factor, Utilitas Mathematics, 98 (2015) 387-391.


[69] Zdenek Ryjacek, Liming Xiong and Jun Yin, Closure and hamilton-connected claw-free hourglass-free graphs, Graphs and Combinatorics, 31(2015) 2369-2376.


[68] Mingqiang An, Liming Xiong, Some results on the difference of the Zagreb indices of a graph, Bull. Aust. Math. Soc., 92(2015) 177-186.


[67] Guifu Su, Liming Xiong, Xiaofeng Su and Xianglian Chen, Some results on the reciprocal sum-degree distance of graphs, J. Comb. Optim., 30(2015) 435-446.


[66] Runli Tian and Liming Xiong, The Chvátal-Erdös condition for a graph to have a spanning trail, Graphs and Combinatorics, 31 (2015) 1739-1754.


[65] Mingqiang An and Liming Xiong, Multiplicatively weighted Harary index of some composite graphs, Filomat, 29 (2015) 795-805.


[64] Mingqiang An, Liming Xiong and Runli Tian, 2-factors in claw-free graphs with locally disconnected vertices, Czechoslovak Math. J., 65 (2015) 317-330.


[63] Runli Tian and Liming Xiong, Hamiltonian claw-free graphs with locally disconnected vertices, Discrete Mathematics, 338 (2015) 2042-2050.


[62] Guantao Chen, Yinkui Li, Haicheng Ma, Tingzeng Wu and Liming Xiong, An extension of the Chvátal-Erdös theorem: Counting the number of maximum independent sets, Graphs and Combinatorics, 31 (2015) 885-896.


[61] Zhaohong Niu, Liming Xiong, On traceable line graphs, Graphs and Combinatorics, 31 (2015) 221-233.


2014


[60] Mingqiang An, Liming Xiong and Kinkar Ch. Das, Two upper bounds for the degree distances of four sums of graphs, Filomat, 28 (2014) 579-590.


[59] Mingqiang An, Hong-Jian Lai, Hao Li, Guifu Su, Runli Tian and Liming Xiong, Two operations on a graph preserving the (non)existence of 2-factors in its line graph, Czechoslovak Math. J., 64(139)  (2014) 1035-1044.


[58] Liming Xiong, Induced hourglass and the equivalence between hamiltonicity and supereulerianity in claw-free graphs, Discrete Mathematics, 332 (2014) 15-22.


[57] Qingning Wang and Liming Xiong, Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs, Int. J. Comput. Math., 91 (2014) 1385-1396.


[56] Runli Tian, Liming Xiong and Zhaohong Niu, On Hamiltonicity of 3-connected claw-free graphs, Graphs and Combinatorics, 30 (2014) 1261-1269.


[55] Zhaohong Niu and Liming Xiong, Smallest k-edge-connected claw-free graphs without special spanning trails, Utilitas Mathematics, 93(2014) 233-248.


[54] Guifu Su, Liming Xiong and Xiaofeng Su, Maximally edge-connected graphs and zeroth-order general Randic index for 0<α<1, Discrete Applied Mathematics, 167 (2014) 261-268.


[53] Zhaohong Niu, Liang Sun, Liming Xiong, Hong-Jian Lai and Huiya Yan, On extremal k-supereulerian graphs, Discrete Mathematics, 314(2014) 50-60.


2013


[52] Guifu Su, Liming Xiong and Ivan Gutman, Harry index of the k-th power of a graph, Applicable Analysis and Discrete Mathematics, 7 (2013)94-105.


[51] Guifu Su, Liming Xiong and Lan Xu, On the Co-PI and Laplacian Co-PI eigenvalues of a graph, Discrete Applied Mathematics, 161 (2013) 277-283.


[50] Guifu Su, Liming Xiong, Yi Sun and Daobin Li, Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts, Theoretical Computer Science, 471 (2013) 74-83.


[49] Xiangwen Li, Chunxiang Wang, Qiong Fan, Zhaohong Niu and Liming Xiong, Spanning eulerian subgraphs of 2-edge-connected graphs, Graphs and Combinatorics, 29 (2013) 275-280.


2012


[48] Runli Tian, Liming Xiong, On hamiltonicity of 2-connected claw-free graphs, Appl. Math. J. Chinese Univ. 27 (2012) 234-242.


[47] Zhaohong Niu, Liming Xiong and Shumin Zhang, Smallest 2-edge-connected claw-free graphs without a spanning trails, Utilitas Mathematics, 88 (2012) 381-397.


[46] Jan Ekstin, Premysl Holub, Tomas Kaiser and Liming Xiong, Shenggui Zhang, Star subdivision and connected even factors in the square of a graph, Discrete Mathematics, 312 (2012) 2574-2578.


[45] Runli Tian, Liming Xiong and Zhaohong Niu, On 2-factors in claw-free graphs whose edges are in small cycles, Discrete Mathematics, 312(2012) 3140-3145.


[44] Guifu Su, Liming Xiong and Lan Xu, The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs, Applied Mathematics Letters, 25 (2012) 1701-1707.


[43] Weihua Yang, Liming Xiong, Hongjian Lai and Xiaofeng Guo, Hamiltonicity of 3-connected line graphs, Applied Mathematics Letters, 25(2012) 1835-1838.


[42] Zhaohong Niu, Hong-Jian Lai and Liming Xiong, Spanning subgraph with eulerian components, Discrete Mathematics, 312 (2012) 1013-1018.


2011


[41] Liming Xiong, Closure operation for even factors on claw-free graphs, Discrete Mathematics, 311 (2011) 1714-1723.


[40] Zdenek Ryjacek, Gerhard J Woeginger, Liming Xiong, Hamiltonian index is NP-complete, Discrete Applied Mathematics, 159 (2011) 246-250.


[39] Liming Xiong, 2-factor with the bounded number of components in line graphs, Applied Mathematic Letters, 24 (2011) 731-734.


[38] Guifu Su, Liming Xiong, Lan Xu and Beibei Ma, On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most k, Filomat, 25 (2011) 75-83.


2010


[37] Longsheng Han, Hong-Jian Lai, Liming Xiong and Huiya Yan, The Chvátal-Erdös condition for supereulerian graphs and the hamiltonian index, Discrete Mathematics, 310 (2010) 2082-2090.


[36] Zhaohong Niu and Liming Xiong, Even factors with the bounded number of components, The Australasian Journal of Combinatorics, 48(2010) 269-279.


[35] Hong-Jian Lai, Liming Xiong, Huiya Yan and Jin Yan, Every 3-connected claw-free Z8-free graph is Hamiltonian, Journal of Graph Theory, 64(2010) 1-11.


[34] Zdenek Ryjacek, Liming Xiong and Kiyoshi Yoshimoto, Closure concept for 2-factors in claw-free graphs, Discrete Mathematics, 310 (2010) 1573-1579.


[33] Liming Xiong and Mingchu Li, Supereulerian index is stable under contractions and closures, Ars Combinatoria, 97 (2010) 129-142.


[32] Longsheng Han, Hong-Jian Lai, Liming Xiong and Huiya Yan, The Chvatal-Erdos condition for supereulerian graphs and the Hamiltonian index, Discrete Mathematics, 310 (2010) 2082-2090.


[31] Hong-Jian Lai, Mingchu Li, Yehong Shao and Liming Xiong, Spanning eulerian subgraphs in N2-locally connected claw-free graphs, Ars Combinatoria, 94 (2010) 191-199.


[30] Zhaohong Niu and Liming Xiong, Supereulerianity of k-edge-connected graphs with a restriction on small bonds, Discrete Applied Mathematics, 158 (2010) 37-43.


[29]Lina Wang and Liming Xiong, On stability of the Hamiltonian index under cycle closure, ACTA Mathematicae Applicatae Sinica (in Chinese), 33 (2010) 424-431.


2009


[28]Akira Saito and Liming Xiong, Closure, stability and iterated line graphs with 2-factor, Discrete Mathematics, 309 (2009) 5000-5010.


[27]Liming Xiong and Minmin Zong, Traceability of line graphs, Discrete Mathematics, 309 (2009) 3779-3785.


[26]Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan and Mingqian Zhan, Hamilton-connected indices of graphs, Discrete Mathematics, 309 (2009) 4819-4827.


[25] Mingchu Li, Yongrui Cui, Liming Xiong, Yuan Tian, He Jiang and Xu Yuan, Circumferences and minimum degrees in 3-connected claw-free graphs, Discrete Mathematics, 309 (2009) 3580-3587.

[24] Liming Xiong, Mei Lu and Longsheng Han, The structure of even factors in claw-free graphs, Discrete Mathematics, 309 (2009) 2417-2423.


[23] Přemysl Holub and Liming Xiong, On distance local connectivity and the Hamiltonian index, Discrete Mathematics, 309 (2009) 2798-2807.


2008


[22] Liming Xiong and Qiuxing Wu, The Hamiltonian index of a 2-connected graph, Discrete Mathematics, 308 (2008) 6373-6382.


[21] Liming Xiong, Qiuxin Wu and MingchuLi, Radius and subpancyclicity in line graphs, Discrete Mathematics, 308 (2008)5325-5333.


[20] Liming Xiong, The existence of even factors in iterated line graphs, Discrete Mathematics, 308(2008)5891-5894.


[19] Mingchu Li, Liming Xiong and H.J. Broersma, Connected even factors in claw-free graphs, Discrete Mathematics, 308 (2008) 2282-2284.


2007


[18] Liming Xiong and Mingchu Li, On the 2-factor index of a graph, Discrete Mathematics, 307 (2007) 2478-2483.


[17] Fujisawa Fu, Liming Xiong, Yoshimoto Kiyoshi and Shenggui Zhang, The upper bound of the number of cycles in a 2-factor of a line graph, Journal of Graph Theory, 55 (2007) 72-82.


[16] H.J.Broersma, Liming Xiong and K.Yoshimoto, Toughness and hamiltonicity in k-trees, Discrete Math., 307 (2007) 832-838.


[15] Mingchu Li, Cheng Guo, Liming Xiong, Dengxin Li and Hong-Jian Lai, Quadrangularly connected claw-free graphs, Discrete Mathematics, 307 (2007) 1205-1211.


[14] Qiuxin Wu, Tingzeng Wu and Liming Xiong, Even factors with degree at most four in claw-free graphs, Lecture Notes in Computer Science, 4489 (2007) 397-400.


[13] Mingchu Li and Liming Xiong, Constructive characterization of regular connected claw-free graphs, Lecture Notes in Computer Science, 4489 (2007) 329-333.


2006


[12] Liming Xiong and H.J. Broersma, Subpancyclicity in line graph and degree sums along paths, Discrete Applied Math., 154 (2006) 1453-1463.


2005


[11] Tomas Kaiser, Mingchu Li, Zdenek Ryjacek and Liming Xiong, Hourglass and Hamiltonian cycles in 4-connected claw-free graphs, J. Graph Theory, 48 (2005) 267-276.


[10] Liming Xiong, Zdenek Ryjacek and H.J.Broesma, On stability of the Hamiltonian index under contractions and closures, J. Graph Theory, 49(2005) 104-115.


[9] Liming Xiong and K.Roman, A note on shortness coefficient and the hamiltonicity in 4-connected line graphs, Graphs and Combinatorics, 21

(2005) 137-144.


2004


[8] Liming Xiong, H.J. Broersma, Xueliang Li and Mingchu Li, The Hamiltonian index of a graph and its branch-bond, Discrete Mathematics, 285(2004) 279-288.


2002


[7] Liming Xiong and Zhanhong Liu, Hamiltonian iterated line graphs, Discrete Mathematics, 256 (2002) 407-422.


[6] Liming Xiong, H.J. Broersma, C. Hoede, and Xueliang Li, Degree sums and subpancyclicity in line graphs, Discrete Mathematics, 242 (2002)

255-267.


[5] H.J. Broersma and Liming Xiong, A note on minimum degree conditions for supereulerian graphs, Discrete Applied Mathematics, 120

(2002) 35-43.


2001


[4] Liming Xiong, The Hamiltonian index of a graph, Graphs and Combinatorics, 27 (2001)7 75-784.


1998


[3] Liming Xiong, On subpancyclic line graphs, J. Graph Theory, 27 (1998) 67-74.


[2] Liming Xiong, Edge degree conditions for subpancyclicity in line graphs, Discrete Mathematics, 188 (1998) 225-232.


1997


[1] Liming Xiong , Some results on closed 2-manifolds (in Chinese), Mathematica Applicata, 10 (2) (1997) 37-39.

Visiting Positions

  1. 05/2015--06/2015, Chern Institute of Mathematics, Nankai University.
  2. 04/2015--05/2015, University of west Bohemia and Institute of Theoretical Computer Science (ITI), Charles University, Czech Republic.
  3. 04/2014--06/2014, University of west Bohemia and Institute of Theoretical Computer Science (ITI), Charles University, Czech Republic.
  4. 06/2010--06/2010, Georgia State University, Atlanta, USA.
  5. 08/2009--10/2009, University of West Bohemia, Pilsen, Czech Republic.
  6. 06/2004--07/2007, Academia Sinica, Taibei, Taiwan, China.
  7. 09/2004--10/2004, Nihon University, Keio University, Tokyo University of Science, Tokyo, Japan.
  8. 10/2001--12/2001, University of West Bohemia, Pilsen, Czech Republic.
  9. 10/1997--01/1998, University Antwerpen, Belgium.

Research Projects

  1. Locally conditions for existence of factors in graphs, Funded by Nature Science Funds of China under Contract Grant No.: 11471037, Jan.2015-Dec.2018, Chief Investigator: Liming Xiong.

  2.  Researches on new contents and methods of the existence of factors in graphs, Funded by Nature Science Funds of China under Contract Grant No.: 11071016, Jan. 2011-Dec. 2013, Chief Investigator: Liming Xiong.

  3. ​Locally conditions for the existence of factors in graphs, Founded by Nature Science Funds of China under Contract Grant No. 1067-1037, Jan. 2015-Dec. 2018, Chief Investigator: Liming Xiong.

  4. Some research on connectivity of group and the existence of subgraphs with its related problem, Funded by Nature Science Funds of China under Contract Grant No.: 11171129, Jan. 2011-Dec. 2014, Chief Investigator: Xiangwen Li (Central China Normal University), Main Participators: Liming Xiong and Liang Sun.

  5. Fuzzification of matroid and its applications in Graph theory, Specialized Research Fund for the Doctoral Program of Higher Education, (No. 20131101110048, Chief Investigator: Fugui Shi and Liming Xiong).

  6. Some research for the conjectures on line graph with its related problem, Funded by Nature Science Funds of Beijing under Contract Grant No. 1102015, Chief Investigator: Leming Li (Capital Normal University), Main Participators: Liming Xiong.

Awards, Honors and Recognitions

04/2011—04/2014, Liming Xiong was a special professor of Qinghai University for Nationalities for Kunlun Scholarship of Qinghai Province.

Graduate Students

Ph. D. Students (in progress):


Mingjing Gao (since Sept. 2013);

Wanpeng Lei (since Sept. 2013);

Shipeng Wang (since Sept. 2014);

Tao Tian (since Sept. 2015);

Junfeng Du (since Sept. 2015);

Xiaojing Yang (since Sept. 2016);

Xia Liu (since Sept. 2016);


Ph. D. Students (completed):

Jun Yin (2016), now work in Qinghai Normal University.

Shengmei Lv (2016), now work in Qinghai Nationalities University.

Mingqiang An (2014), now work in Tianjin University of Science and Technology.

Guifu Su (2014), he received the Excellent Ph.D.Thesis of BIT; now work in Beijing University of Chemical Technology.

Runli Tian (2013), now work in Central South University of Forestry and Technology.

Zhaohong Niu (2011), he received the Excellent Ph.D.Thesis of BIT; now work in Shanxi University.


M.Sc. Students (Completed): In Jiangxi Normal University:

Zeming Jin (2002), got his Ph.D. in Nankai University; now work in Zhejiang Normal University, Jinhua, Zhejiang.

Huaping Wang (2002), now work in Jiangxi Normal University, Nanchang, Jiangxi.

Jing Zhang (2002), now work in Jiangxi Normal University, Nanchang, Jiangxi.

Siming Zhou(2002), got his Ph. D. in Xiamen University; now work in Fujian Normal University, Fuzhou, Fujian.

Qiong Liu and Ruifu Liu (2005), now work in Hangzhou Second Middle School, Hangzhou, Zhejiang.

Lu Wang (2005), now work in College of Yangquan, Shanxi University of Technology, Yangquan, Shanxi.

Xueli Yao (2005), now work in Institute of Technology, East China JiaoTong University, Nanchang, Jiangxi.

In Beijing Institute of Technology

Huiya Yan (2005), got his Ph. D. in West Virginia University, Morgan town, U.S.A; now work in University of Wisconsin-La Crosse, La Crosse, U.S.A.

Tingzeng Wu (2007), now work in Qinghai Nationalities University, Xining, Qinghai.

Lei Ma (2007), now work in Agricultural Bank of China, Beijing.

Lina Wang (2007), now work in Henan Polytechnic University, Jiaozuo, Henan.

Minmin Zong (2008), now work in the Huzhou Educational Group of Elementary School, Huzhou, Zhejiang.

Mengmeng Li and Xue Xue(2009), now work in Beijing.

Hui Du (2010), now in Japan.

Ronghui Fu(2009-2012), now work in Beijing.

Yueting Li(2009-2012), no work in Beijing.

Qianqian Zhu(2013-2016), now work in Beijing.


Recommended Oversea Students:

Jie Han (2010), got his B.Sc. in BIT; and got his Ph. D. in the Georgia State University, Atlanta, Georgia, U.S.A., now do Postdoctoral research in University of Birmingham, Edgbaston Birmingham, UK.

Chuanyun Zang (2011), got her B.Sc. in BIT;  and got her Ph. D. in the Department of Mathematics and Statistics, Georgia State University, Atlanta, Georgia, U.S.A.

Conference Talks and Invited Presentations

  • Forbidden subgraphs and Hamiltonian claw-free graph with locally disconnected vertices(invited talk), The 8th Slovenian International Conference on Graph Theory, University of Ljubljana, Ljubljana, Slovenia, June 21–27, 2015.
  • Singular edges and Hamiltonian claw-free graph with locally disconnected vertices (invited talk), the 8th workshop on Matthews-Sumner Conjecture and Related Problems, Plzen, The Czech Republic, March 29-April 3, 2015.
  • Forbidden subgraphs and hamiltonian properties of a graph with locally disconnected vertices (invited talk), Center of Combinatorics, Nankai University, Tianjin, June 8, 2015.
  • Hamilotnian Claw-free Graphs and Induced Cycles (invited talk), Workshop on Graph Theory and Combinatorial Optimization, Nankai University, Tianjin, Nov. 14-15, 2015.
  • Forbidden subgraphs and hamiltonian properties of a graph with locally disconnected vertices (invited talk), International Workshop on Graph Theory and Combinatorics, Wuhan, June 30, 2015.
  • Forbidden subgraphs and hamiltonian properties (of a graph with locally disconnected vertices), Department of Mathematics, Yantai University, August 7, 2015.
  • Locally conditions for a graph to be Hamilton-(connected)(invited talk), The 6th National Conference on Combinatorics and Graph Theory, South China Normal University, Guangzhou, China, Nov. 7 –10, 2014.
  • The First Sino-Japan symposium on Graph Theory, Combinatorics and their Applications (SJ-SGCA'2014), Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, Oct. 29-Nov. 1, 2014.
  • Factors of graphs (invited talk), Workshop on Graph theory and Combinatorics, Nanjing University, August 18-25, 2014.
  • Connected even factors in locally connected graphs (invited talk), 18th international graph theory workshop, Germany, April-June 2014.
  • Connected even factors in locally connected graphs (invited talk), Conference on Graph Theory, Nankai University, July 18 2014.
  • The 5th International Symposium on Graph Theory and Combinatorial Algorithms(GTCA'2013), Inner Mongolia University for Nationalities, Tongliao, China, July 12-14, 2013.
  • Hourglass property and equivalence between Hamiltonicity and Supereulerianity of claw-free graphs (invited talk), International Conference on Cycles in Graphs, The Department of Mathematics at Vanderbilt University, USA, May 30-June 2, 2012.
  • Hamiltonian claw-free graphs with locally disconnected vertices (invited talk), International Conference on Graph Theory and Combinatorics with its Application, Jinhua, Zhejiang Province, Oct. 26-30, 2012.
  • On Hamiltonian claw-free graphs (invited talk), International Workshop of Graph Theory and Combinatorial, Qinghai Normal University, Xining, Qinghai, June 2012.
  • An extension of the Chv/'{a}tal-Erd/"{o}s theorem: Counting the number of maximum independent sets (invited talk), Workshop on Graph Theory and Combinatorial Optimization, Shanghai University, Shanghai, (GTCO2011).
  • Closure operations for even factors in claw-free graphs, Fifith Cross-strait Conference on Graph Theory and Combinatorics, Nankai University, June24-29,2009,China.
  • Some results related to the branch-bonds, The third National Conference on Combinatorics and Graph Theory, East China Normal University, July19-23, 2008, Shanghai.
  • Subpancyclic line graphs of a graph with larger sum of degree along a path, 2007 International Conference on Graph Theory and Combinatorics& Fourth Cross-strait Conference on Graph Theory and Combinatorics, June24-29,2007, National Taiwan University, Taipei, Taiwan, China.
  • Chvatal-Erdos condition for supereulerian graphs and the Hamiltonian index, The 2th International Symposium on Graph Theory and Combinatorial Algorithms (GTCA2007), Chinese Academia of Sciences, July 1-3, Beijing.
  • 2-factors with a bounded number of components in line graphs, The 2th National Conference on Combinatorics and Graph Theory, Aug.16-19, 2006, Nankai University, Tianjin, China.
  • Hamiltonian index is NP-complete, 2006 National Conference on Combinatorial Optimization, Zhengzhou University, Nov.4-6, Zhengzhou, China.
  • The Hamiltonian index of graphs (invited talk), 2006 Spring Conference on Combinatorics and Graph Theory, Nankai University, April21-23, Tianjin, China.
  • Hamiltonian cycles in 4-connected claw-free graphs, The Third Cross-strait Conference on Graph Theory and Combinatorics, Zhejiang Normal University, Jun. 26-30, 2005, Jinhua, Zhejiang, China.
  • On the Hamiltonian index of a graph and its related problems, The 9th National Conference of Graph Theory and its Application, Yantai University, Aug. 1999, Yantai.

Conference Organization

Grants & Scholarships Assessor

International Refereed Journals

International Refereed Proceedings