Liming Xiong

VLDB 2026 Research / reviewers in the wild / expert

dblp:59/6547 · DBLP profile ↗

← Back

17ranked-venue papers

2as first author

7since 2021 · last 2026

0000-0002-3091-3252ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 17 · 2 first-author · 7 since 2021Databases, data management, data science and information retrieval · 1

Year	Publication	Venue	Position
2026	Hamilton-connected claw-free graphs with small parameters Liming Xiong	Discret. Appl. Math.	2
2025	Every 2-connected {claw, Z2}-free graph with minimum degree at least 4 contains two CISTs Liming Xiong, Guifu Su	Discret. Appl. Math.	3
2025	Research problems from the 1st Chinese-Southeasteuropean conference on discrete mathematics and applications Vedran Krcadinac, Shenggui Zhang, Liming Xiong, Dragan Stevanovic	Discret. Appl. Math.	3
2025	Forbidden Pairs of disconnected graphs for traceability and hamiltonicity Hongli Liao, Liming Xiong	Discret. Appl. Math.	3
2025	Forbidden pairs for 2-factorable and hamiltonian graphs under the necessary condition Liming Xiong	Discret. Appl. Math.	2
2023	On the dominating (induced) cycles of iterated line graphs Yibin Fang, Liming Xiong	Discret. Appl. Math.	2
2021	Forbidden subgraphs for supereulerian and hamiltonian graphs abstract A graph is called supereulerian if it has a spanning eulerian subgraph. A graph is said to be hamiltonian if it has a spanning cycle. A nontrivial path is called a branch if it has only internal vertices of degree two and end vertices of degree not two. Let S be a set of branches of G, then S is called a branch cut if G−S has more components than G. A minimal branch cut is called a branch-bond. In this paper, we characterize one or pairs of those forbidden subgraphs that force a 2-edge-connected graph satisfying that every odd branch-bond has an edge branch to be supereulerian. We also characterize one or pairs of those forbidden subgraphs that force a 2-connected supereulerian graph to be hamiltonian. Xiaojing Yang, Junfeng Du, Liming Xiong	Discret. Appl. Math.	3
2019	Reciprocal degree distance and graph properties Mingqiang An, Kinkar Chandra Das, Liming Xiong	Discret. Appl. Math.	4
2018	Some results on the inverse sum indeg index of a graph Mingqiang An, Liming Xiong	Inf. Process. Lett.	2
2017	Characterization of forbidden subgraphs for the existence of even factors in a graph Liming Xiong	Discret. Appl. Math.	1
2014	Maximally edge-connected graphs and Zeroth-order general Randić index for 0<α<1 Guifu Su, Liming Xiong, Xiaofeng Su	Discret. Appl. Math.	2
2013	On the Co-PI and Laplacian Co-PI eigenvalues of a graph Guifu Su, Liming Xiong	Discret. Appl. Math.	2
2013	Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts Guifu Su, Liming Xiong, Brian Yi Sun, Daobin Li	Theor. Comput. Sci.	2
2011	Hamiltonian index is NP-complete Zdenek Ryjácek, Gerhard J. Woeginger, Liming Xiong	Discret. Appl. Math.	3
2010	Supereulerianity of k-edge-connected graphs with a restriction on small bonds Zhaohong Niu, Liming Xiong	Discret. Appl. Math.	2
2006	Subpancyclicity of line graphs and degree sums along paths Liming Xiong, Hajo Broersma	Discret. Appl. Math.	1
2002	A note on minimum degree conditions for supereulerian graphs Hajo Broersma, Liming Xiong	Discret. Appl. Math.	2