My research

Research Interests

§         Line graphs and claw-free graphs

§         Eulerian graphs, Supereulerian graphs

§         Group connectivity

§         Matroid Theory

 

Recent Papers

  1. Pancyclicity in 4-connected claw-free, net-free graphs (with Hong-Jian Lai, Ju Zhou, and Taoye Zhang), submitted
  2. s-hamiltonian connected line graphs (with Hong-Jian Lai, Xiaoling Ma, Ju Zhou, and Taoye Zhang), submitted
  3. Almost spanning trails and Chvatal-Erdos conditions, submitted
  4. On s-hamiltonicity of net-free line graphs, submitted
  5. On the line graph of a graph with diameter two, submitted
  6. Catlin's reduced graps with small orders, in preparation
  7. On s-hamiltonicity of Z_8-free line graphs, in preparation
  8. Hamiltonicity of 3-connected line graphs of diameter three (with Hong-Jian Lai, Ju Zhou, and Taoye Zhang), in preparation

 

Publication List

  1. A discharging method to find subgraphs having two edge-disjoint spanning trees (with Hong-Jian Lai, and Keke Wang), ARS Combinatoria, accepted.
  2. On s-hamiltonian line graphs of claw-free graphs (with Hong-Jian Lai, Ju Zhou, and Taoye Zhang), Discrere Mathematics 342(11), 3006-3016, 2019.
  3. Pancyclicity in 4-connected claw-free Z_8-free graphs (with Hong-Jian Lai, Ju Zhou, and Taoye Zhang), Graphs and Combinatorics, 35 (2019), 67-89.
  4. Strongly spanning trailable graphs with short longest paths (with Hong-Jian Lai, Ping Li, and Keke Wang), ARS Combinatoria, 137 (2018), 3-39.
  5. Full cycle extendability of nearly claw-free graphs (with Shuxin), ARS Combinatoria, 127(2016), 339-356.
  6. Graphs with a 3-cycle 2-over (with Zhi-Hong Chen, Miaomiao Han, and Hong-Jian Lai), Graphs and Combinatorics, 31(2015), 2103-2111.
  7. K_5^--factor in a graph (with Hong-Jian Lai, Yehong Shao), ARS Combinatoria, 122 (2015), 97-124.
  8. Z_3-connectvity in Abelian Cayley graphs (with Hao Li, Ping Li, Ju Zhou and Taoye Zhang), Discrete Mathematics, 313 (2013), 1666-1676.
  9. Spanning cycles in reguler matroids without small cocircuits, European Journal of Combinatorics, 33(8), 1765-1776 (2012).
  10. Z_3-connectivity of 4-edge-connected 2-triangular graphs (with Xinmin Hou, Hong-Jian Lai, Ju Zhou, Taoye Zhang), European Journal of Combinatorics, 33(2012), 182-188.
  11. Group Connectivity and Group Colorings of Graphs-A survey (with Hong-Jian Lai, Xiangwen Li, Yehong Shao), Acta Mathematica Sinica, English Series, Vol 27, Number 3 (2011), 405-434.
  12. On 3-edge-connected supereulerian graphs (with Hong-Jian Lai, Hao Li and Yehong Shao), Graphs and Combinatorics, 27 (2011), 207-214.
  13. Hamiltonicity of 6-connected line graphs, Discrete Applied Mathematics, 158(2010), 1971-1975.
  14. Degree Sum and Z_3-connectivity (with Hong-Jian Lai, Xiangwen Li, Yehong Shao, Rui Xu, Xiaoxia Zhang), Discrete Mathematics, 310(2010), 3390-3397.
  15. Full cycle extendability of triangularly connected almost claw-free graphs, ARS Combinatoria, (96)2010, 489-497.   
  16. Hamilton-connected indices of graphs (with Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan), Discrete Mathematics, 309 (2009), 4819-4827.
  17. Hamiltonian connectedness in 3-connected line graphs (with Hong-Jian Lai, Yehong Shao, and Gexin Yu), Discrete Applied Mathematics, 157(2009), 982-990.
  18. Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected (with Hong-Jian Lai, Yehong Shao), Discrete Mathematics, 308 (2008), 5312-5316.
  19. Hamiltonian connected hourglass free line graphs (with Hong-Jian Lai, Dengxin Li and Yehong Shao), Discrete Mathematics, 308 (2008), 2634-2636.
  20. Vertex pancyclicity in quasi claw-free graphs, Discrete Mathematics,307(2007), 1679-1683.
  21. Hamiltonicity in 3-connected claw-free graphs (with Hong-Jian Lai and Yehong Shao), J. Combinatorial Theory, Series B, Vol. 96, Issue 4(2006), 493-504.
  22.  Supereulerian planar graphs (with Hong-Jian Lai, Deying Li and Jingzhong Mao), ARS Combinatoria, 75 (2005), 313-331.
  23. Every 3-connected N2-locally connected claw-free graph is Hamiltonian (with Hong-Jian Lai, Yehong Shao), J. Graph Theory, Vol. 48, Issue 2 (2005), 142-146. 
  24. Eulerian subgraphs and Hamilton-connected line graphs (with Hong-Jian Lai, Dengxin Li), Discrete Applied Mathematics, 145(2005), 422-428
  25. Neighborhood intersections and hamiltonicity in almost claw-free graphs, Discrete Mathematics, 243(2002), 171-185
  26. The neighborhood intersections of essential sets and the traceable properties of K1,r-free graphs,  Journal of Southeast University, Volume 29,  Issue 6 (1999), 94-98.
  27. Two sufficient conditions for (k+1)-connected K1,r –free graphs to be Hamilton-connected (with Xinping Xu), Journal of Liongning University (Natural Science), Vol. 25, Issue 4 (1998), 301-308.
  28. Hamilton-connected properties of (k+1)-connected claw-free graphs (with Xinping Xu), Journal of Nanjing Normal University (Natural Science), Volume 21, Issue 2 (1998), 12-21.
  29. A discussion on k-connected claw center independent graphs being Hamiltonian using essentials sets (with Xinping Xu), Journal of Nanjing University Mathematical Bi-quarterly, Volume 14, Issue 2 (1997), 258-265.
  30. A sufficient conditions for claw center independent graphs having Hamilton-path (with Xinping Xu), Journal of Nanjing Normal University (Natural Science), Volume 20, Issue 3 (1997), 15-18.
  31. A discussion on graphs being traceable using essential sets (with Xinping Xu), Journal of Jiangsu Education College (Natural Science), 1 (1997), 6-11.
  32. Hamiltonicity of k-connected claw center independent graph (with Xinping Xu), Journal of Jiangsu Education College (Natural Science), 2 (1996), 1-4.      

 

Back to My Homepage