According to our database
1,
Liming Xiong
authored at least 111 papers
between 1998 and 2024.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2024
Paw-Type Characterization of Hourglass-Free Hamilton-Connected Graphs.
Axioms, January, 2024
2023
Edge-Diameter of a Graph and Its Longest Cycles.
Graphs Comb., August, 2023
Forbidden Pairs for Connected Even Factors in Supereulerian Graphs.
Graphs Comb., August, 2023
Hamilton-connected {claw,net}-free graphs, II.
J. Graph Theory, May, 2023
Hamilton-connected {claw, net}-free graphs, I.
J. Graph Theory, 2023
Forbidden subgraphs for existences of (connected) 2-factors of a graph.
Discuss. Math. Graph Theory, 2023
On the dominating (induced) cycles of iterated line graphs.
Discret. Appl. Math., 2023
2022
Forbidden Pairs of Disconnected Graphs for Traceability of Block-Chains.
Symmetry, 2022
Forbidden pairs of disconnected graphs for 2-factor of connected graphs.
J. Graph Theory, 2022
Hamiltonian extendable graphs.
Discuss. Math. Graph Theory, 2022
Forbidden subgraphs for collapsible graphs and supereulerian graphs.
Discuss. Math. Graph Theory, 2022
Supereulerian line graphs.
Discret. Math., 2022
A note on 3-connected hourglass-free claw-free Hamilton-connected graphs.
Discret. Math., 2022
Characterizing forbidden pairs for relative length of longest paths and cycles.
Discret. Math., 2022
Two completely independent spanning trees of claw-free graphs.
Discret. Math., 2022
Edge Degree Conditions for 2-Iterated Line Graphs to Be Traceable.
Axioms, 2022
The Independence Number Conditions for 2-Factors of a Claw-Free Graph.
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
Circumference of a graph and its distance dominating longest cycles.
Discret. Math., 2021
Forbidden subgraphs for supereulerian and hamiltonian graphs.
Discret. Appl. Math., 2021
2020
Forbidden Subgraphs for a Graph to Have a Hamiltonian Path Square.
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
On sufficient degree conditions for traceability of claw-free graphs.
Discret. Math., 2020
Forbidden subgraphs on Hamiltonian index.
Discret. Math., 2020
Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3.
Discret. Math., 2020
2019
Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs.
Graphs Comb., 2019
The Local Structure of Claw-Free Graphs Without Induced Generalized Bulls.
Graphs Comb., 2019
Large degree vertices in longest cycles of graphs, II.
Electron. J. Graph Theory Appl., 2019
On the independence number of traceable 2-connected claw-free graphs.
Discuss. Math. Graph Theory, 2019
Reciprocal degree distance and graph properties.
Discret. Appl. Math., 2019
Spanning Trails in a 2-Connected Graph.
Electron. J. Comb., 2019
Number of vertices of degree three in spanning 3-trees in square graphs.
Appl. Math. Comput., 2019
2018
Passing waves from atomistic to continuum.
J. Comput. Phys., 2018
Some results on the inverse sum indeg index of a graph.
Inf. Process. Lett., 2018
Forbidden Subgraphs and Weak Locally Connected Graphs.
Graphs Comb., 2018
Hamiltonian properties of 3-connected {claw, hourglass}-free graphs.
Discret. Math., 2018
Erratum to "Forbidden pairs for spanning (closed) trails" [Discrete Math. 340 (2017) 1012-1018].
Discret. Math., 2018
Pairs of forbidden subgraphs and 2-connected supereulerian graphs.
Discret. Math., 2018
Traceability on 2-connected line graphs.
Appl. Math. Comput., 2018
2017
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs.
J. Comb. Theory, Ser. B, 2017
Forbidden set of induced subgraphs for 2-connected supereulerian graphs.
Discret. Math., 2017
Forbidden pairs for spanning (closed) trails.
Discret. Math., 2017
Forbidden pairs of disconnected graphs for traceability in connected graphs.
Discret. Math., 2017
Characterization of forbidden subgraphs for the existence of even factors in a graph.
Discret. Appl. Math., 2017
Connected Even Factors in the Square of Essentially 2-Edge-connected Graph.
Electron. J. Comb., 2017
Extremal polyomino chains with respect to general sum-connectivity index.
Ars Comb., 2017
2016
Maximally edge-connected graphs and Zeroth-order general Randić index for α ≤ -1.
J. Comb. Optim., 2016
Extremal polyomino chains with respect to general Randić index.
J. Comb. Optim., 2016
Hamiltonian Claw-Free Graphs and o-Heavy Graphs Involving Induced Cycles.
Graphs Comb., 2016
The Ryjáček closure and a forbidden subgraph.
Discuss. Math. Graph Theory, 2016
Large degree vertices in longest cycles of graphs, I.
Discuss. Math. Graph Theory, 2016
2015
Some results on the reciprocal sum-degree distance of graphs.
J. Comb. Optim., 2015
The Chvátal-Erdős Condition for a Graph to Have a Spanning Trail.
Graphs Comb., 2015
Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs.
Graphs Comb., 2015
On Traceable Line Graphs.
Graphs Comb., 2015
An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets.
Graphs Comb., 2015
Hamiltonian claw-free graphs with locally disconnected vertices.
Discret. Math., 2015
A coherent phonon pulse model for transient phonon thermal transport.
Comput. Phys. Commun., 2015
2014
Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs.
Int. J. Comput. Math., 2014
On Hamiltonicity of 3-Connected Claw-Free Graphs.
Graphs Comb., 2014
Induced hourglass and the equivalence between hamiltonicity and supereulerianity in claw-free graphs.
Discret. Math., 2014
On extremal k-supereulerian graphs.
Discret. Math., 2014
Maximally edge-connected graphs and Zeroth-order general Randić index for 0<α<1.
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
Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs.
Graphs Comb., 2013
On the Co-PI and Laplacian Co-PI eigenvalues of a graph.
Discret. Appl. Math., 2013
2012
On 2-factors in claw-free graphs whose edges are in small cycles.
Discret. Math., 2012
Spanning subgraph with Eulerian components.
Discret. Math., 2012
Star subdivisions and connected even factors in the square of a graph.
Discret. Math., 2012
Hamiltonicity of 3-connected line graphs.
Appl. Math. Lett., 2012
The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs.
Appl. Math. Lett., 2012
2011
Closure operation for even factors on claw-free graphs.
Discret. Math., 2011
Hamiltonian index is NP-complete.
Discret. Appl. Math., 2011
2-factors with the bounded number of components in line graphs.
Appl. Math. Lett., 2011
2010
Every 3-connected claw-free <i>Z</i><sub>8</sub>-free graph is Hamiltonian.
J. Graph Theory, 2010
Closure concept for 2-factors in claw-free graphs.
Discret. Math., 2010
The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index.
Discret. Math., 2010
Supereulerianity of k-edge-connected graphs with a restriction on small bonds.
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
Even factor of a graph with a bounded number of components.
Australas. J Comb., 2010
2009
Traceability of line graphs.
Discret. Math., 2009
The structure of even factors in claw-free graphs.
Discret. Math., 2009
Closure, stability and iterated line graphs with a 2-factor.
Discret. Math., 2009
Circumferences and minimum degrees in 3-connected claw-free graphs.
Discret. Math., 2009
On distance local connectivity and the hamiltonian index.
Discret. Math., 2009
Hamilton-connected indices of graphs.
Discret. Math., 2009
2008
Radius and subpancyclicity in line graphs.
Discret. Math., 2008
The hamiltonian index of a 2-connected graph.
Discret. Math., 2008
The existence of even factors in iterated line graphs.
Discret. Math., 2008
Connected even factors in claw-free graphs.
Discret. Math., 2008
2007
The upper bound of the number of cycles in a 2-factor of a line graph.
J. Graph Theory, 2007
On the 2-factor index of a graph.
Discret. Math., 2007
Quadrangularly connected claw-free graphs.
Discret. Math., 2007
Toughness and hamiltonicity in k-trees.
Discret. Math., 2007
Even Factors with Degree at Most Four in Claw-Free Graphs.
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
Subpancyclicity of line graphs and degree sums along paths.
Discret. Appl. Math., 2006
2005
On stability of the hamiltonian index under contractions and closures.
J. Graph Theory, 2005
Hourglasses and Hamilton cycles in 4-connected claw-free graphs.
J. Graph Theory, 2005
A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs.
Graphs Comb., 2005
Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs.
Electron. Notes Discret. Math., 2005
2004
The hamiltonian index of a graph and its branch-bonds.
Discret. Math., 2004
2002
Hamiltonian iterated line graphs.
Discret. Math., 2002
Degree sums and subpancyclicity in line graphs.
Discret. Math., 2002
A note on minimum degree conditions for supereulerian graphs.
Discret. Appl. Math., 2002
2001
The Hamiltonian Index of a Graph.
Graphs Comb., 2001
1998
On subpancyclic line graphs.
J. Graph Theory, 1998
Edge degree conditions for subpancyclicity in line graphs.
Discret. Math., 1998
