# Liming Xiong

Orcid: 0000-0002-3091-3252
According to our database

Collaborative distances:

^{1}, Liming Xiong authored at least 112 papers between 1998 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

Axioms, January, 2024

Discuss. Math. Graph Theory, 2024

2023

Graphs Comb., August, 2023

Graphs Comb., August, 2023

J. Graph Theory, May, 2023

J. Graph Theory, 2023

Discuss. Math. Graph Theory, 2023

Discret. Appl. Math., 2023

2022

Symmetry, 2022

J. Graph Theory, 2022

Discuss. Math. Graph Theory, 2022

Discuss. Math. Graph Theory, 2022

Discret. Math., 2022

Discret. Math., 2022

Discret. Math., 2022

Discret. Math., 2022

Axioms, 2022

Axioms, 2022

Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree.

Axioms, 2022

2021

Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs.

Graphs Comb., 2021

Discret. Math., 2021

Discret. Appl. Math., 2021

2020

Graphs Comb., 2020

A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices.

Graphs Comb., 2020

2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices.

Discuss. Math. Graph Theory, 2020

Discret. Math., 2020

Discret. Math., 2020

Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3.

Discret. Math., 2020

2019

Graphs Comb., 2019

Graphs Comb., 2019

Electron. J. Graph Theory Appl., 2019

Discuss. Math. Graph Theory, 2019

Discret. Appl. Math., 2019

Electron. J. Comb., 2019

Appl. Math. Comput., 2019

2018

J. Comput. Phys., 2018

Inf. Process. Lett., 2018

Graphs Comb., 2018

Discret. Math., 2018

Erratum to "Forbidden pairs for spanning (closed) trails" [Discrete Math. 340 (2017) 1012-1018].

Discret. Math., 2018

Discret. Math., 2018

Appl. Math. Comput., 2018

2017

J. Comb. Theory B, 2017

Discret. Math., 2017

Discret. Math., 2017

Discret. Math., 2017

Characterization of forbidden subgraphs for the existence of even factors in a graph.

Discret. Appl. Math., 2017

Electron. J. Comb., 2017

Extremal polyomino chains with respect to general sum-connectivity index.

Ars Comb., 2017

2016

J. Comb. Optim., 2016

J. Comb. Optim., 2016

Graphs Comb., 2016

Discuss. Math. Graph Theory, 2016

Discuss. Math. Graph Theory, 2016

2015

J. Comb. Optim., 2015

Graphs Comb., 2015

Graphs Comb., 2015

Graphs Comb., 2015

An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets.

Graphs Comb., 2015

Discret. Math., 2015

Comput. Phys. Commun., 2015

2014

Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs.

Int. J. Comput. Math., 2014

Graphs Comb., 2014

Induced hourglass and the equivalence between hamiltonicity and supereulerianity in claw-free graphs.

Discret. Math., 2014

Discret. Math., 2014

Discret. Appl. Math., 2014

2013

Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts.

Theor. Comput. Sci., 2013

Graphs Comb., 2013

Discret. Appl. Math., 2013

2012

Discret. Math., 2012

Discret. Math., 2012

Discret. Math., 2012

Appl. Math. Lett., 2012

The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs.

Appl. Math. Lett., 2012

2011

Discret. Math., 2011

Discret. Appl. Math., 2011

Appl. Math. Lett., 2011

2010

J. Graph Theory, 2010

Discret. Math., 2010

Discret. Math., 2010

Discret. Appl. Math., 2010

Supereulerian index is stable under contractions and closures.

Ars Comb., 2010

Spanning eulerian subgraphs in N<sup>2</sup>-locally connected claw-free graphs.

Ars Comb., 2010

Australas. J Comb., 2010

2009

Discret. Math., 2009

Discret. Math., 2009

Discret. Math., 2009

Discret. Math., 2009

Discret. Math., 2009

Discret. Math., 2009

2008

Discret. Math., 2008

Discret. Math., 2008

Discret. Math., 2008

Discret. Math., 2008

2007

J. Graph Theory, 2007

Discret. Math., 2007

Discret. Math., 2007

Discret. Math., 2007

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Linear Polynomial-Time Algorithms To Construct 4-Connected 4-Regular Locally Connected Claw-Free Graphs.

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006

Discret. Appl. Math., 2006

2005

J. Graph Theory, 2005

J. Graph Theory, 2005

A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs.

Graphs Comb., 2005

Electron. Notes Discret. Math., 2005

2004

Discret. Math., 2004

2002

Discret. Math., 2002

Discret. Math., 2002

Discret. Appl. Math., 2002

2001

Graphs Comb., 2001

1998

J. Graph Theory, 1998

Discret. Math., 1998