My research

---

Research Interests

•  Graph Theory and Combinatorics

§         Almost claw-free graphs, Quasi-claw-free graphs, Claw-free graphs

§         Eulerian graphs, Supereulerian graphs

§         Group connectivity

§         Line graphs

Presentations at Professional Conferences

• K-5-factor in a graph, 23^rdMidwest Conference on Combinatorics, Cryptography, and Computing, October 3-4, 2009, Rochester Institute of Technology

• On 3-edge-connected supereulerian graphs, 3rd Annual International Conference on Combinatorial Optimization and Applications, 6/10/2009~6/12/2009, Yellow Mountains, China

• Vertex-disjoint chorded cycles in graphs, 46^th Midwest Graph Theory Conference, 04/25/2008~04/26/2008, West Virginia University, Morgantown, WV 26505.

• Hamiltonian cycles in claw-free graphs,  MSM ACM/MAA Lecture Series, Mount St. Mary’s University, October 3, 2007

• Triangularly connected quasi claw-free graphs and almost claw-free graphs,  20^th Cumberland Conference on Discrete Mathematics, Emory University, May 17-19, 2007

• Cycles in claw-free graphs, Joint Colloquium of Millersville University and Franklin & Marshall College, 10/20/2005, Franklin & Marshall College, Lancaster, PA

• Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected, 17^th Cumberland Conference on Combinatorics, Graph Theory, and Computing, 05/20/2004 ~ 05/22/2004, Middle Tennessee State University, Murfreesboro, TN.

• A closure concept in claw-free graphs and its application, Colloquium, 10/30/2003, Millersville University and Franklin & Marshall College, Millersville, PA.

• Hamiltonicity in 3-connected claw-free graphs, 16^th Cumberland Conference on Combinatorics, Graph Theory, and Computing, 05/15/2003 ~ 05/17/2003, Georgia State University, Atlanta, GA.

• Hamiltonicity in almost claw-free graphs, 2003 Joint Mathematics Meeting in Baltimore, MD, January 14-18, 2003.

• On a closure concept in claw-free graphs, Combinatorics seminar, 10/09, 16/2002, West Virginia University, Morgantown, WV.

• Supereulerian matroids, 35^th Midwest Graph Theory Conference, 09/27/2002~09/28/2002, Illinois State University, Normal, Illinois.

• Neighborhood intersections and hamiltonicity in almost claw-free graphs, 15^th Cumberland Conference on Combinatorics, Graph Theory, and Computing, 05/16/2002 ~ 05/18/2002, University of Mississippi, Oxford, MS.

• Supereulerian planar graphs, 34^th Midwest Graph Theory Conference, 10/13/2001~10/14/2001, Oakland University, Rochester, Michigan.

• Co-supereulerian and girth, 2001 Spring Eastern Section Meeting of the AMS, 4/28/2001~4/29/2001, Hoboken, NJ.

 

Recent Papers

1. Hamilton cycles in 3-connected claw-free graphs, submitted

2. K_5^--factor in a graph, submitted

3. On 3-edge-connected supereulerian graphs, submitted

4. Hamiltonicity of 6-connected line graphs, submitted

 

Publication List

1. Full cycle extendability of triangularly connected almost claw-free graphs, ARS Combinatoria, accepted.

2. Degree Sum and Z_3-connectivity (with Hong-Jian Lai, Xianwen Li, Yehong Shao, Rui Xu, Xiaoxia Zhang), Discrete Mathematics, accepted

3. Hamilton-connected indices of graphs (with Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan), Discrete Mathematics, 309 (2009), 4819-4827.

4. Hamiltonian connectedness in 3-connected line graphs (with Hong-Jian Lai, Yehong Shao, and Gexin Yu), Discrete Applied Mathematics, 157(2009), 982-990.

5. 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.

6. Hamiltonian connected hourglass free line graphs (with Hong-Jian Lai, Dengxin Li and Yehong Shao), Discrete Mathematics, 308 (2008), 2634-2636.

7. Vertex pancyclicity in quasi claw-free graphs, Discrete Mathematics,307(2007), 1679-1683.

8. 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.

9.  Supereulerian planar graphs (with Hong-Jian Lai, Deying Li and Jingzhong Mao), ARS Combinatoria, 75 (2005), 313-331.

10. 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. 

11. Eulerian subgraphs and Hamilton-connected line graphs (with Hong-Jian Lai, Dengxin Li), Discrete Applied Mathematics, 145(2005), 422-428

12. Neighborhood intersections and hamiltonicity in almost claw-free graphs, Discrete Mathematics, 243(2002), 171-185

13. The neighborhood intersections of essential sets and the traceable properties of K1,r-free graphs, J. Southeast University, Vol. 29, 1999(6)

14. Two sufficient conditions for (k+1)-connected K1,r –free graphs to be Hamilton-connected (with Xinping Xu), J. Liongning University (Natural Science), Vol. 25, 1998(4)

15. Hamilton-connected properties of (k+1)-connected claw-free graphs (with Xinping Xu), J. Nanjing Normal University (Natural Science), Vol. 21, 1998(2)

16. A discussion on k-connected claw center independent graphs being Hamiltonian using essentials sets (with Xinping Xu), J. Nanjing University Mathematical Bi-quarterly, Vol. 14, N0.2 (1997)

17. A sufficient conditions for claw center independent graphs having Hamilton-path (with Xinping Xu), J. Nanjing Normal University (Natural Science), Vol. 20, 1997(3)

18. A discussion on graphs being traceable using essential sets (with Xinping Xu), J. Jiangsu Education College (Natural Science), 1997(1)

19. Hamiltonicity of k-connected claw center independent graph (with Xinping Xu), J. Jiangsu Education College (Natural Science), 1996(2)

 

 

 

Back to My Homepage