11 Papers
7 Citations
Xia Liu is an academic researcher from Beijing Institute of Technology. The author has contributed to research in topics: Computer science & Induced subgraph. The author has an hindex of 2, co-authored 4 publications.
Chat about Author
Papers
Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs
TL;DR: It is proved that every 2-connected 3-edge-connected graph with circumference at most 8 is strongly spanning trailable with an exception of order 8 and every 3-connected K 1, 3, P 10 -free graph is Hamilton-connected with a well-defined exception.
10
Hamilton‐connected {claw, net}‐free graphs, I
TL;DR: In this paper , the authors complete the characterization of forbidden generalized nets implying Hamilton-connectedness of a 3-connected claw-free graph, and develop the necessary techniques that allow one to handle the problem.
6
Hamilton‐connected {claw,net}‐free graphs, II
TL;DR: In this paper , it was shown that every 3-connected claw-free graph X ∈ { N 1, 1, 5 , N 2 , 2 , 3 } is Hamilton-connected.
5
Forbidden Subgraphs and Weak Locally Connected Graphs
Xia Liu,Houyuan Lin,Liming Xiong +2 more
TL;DR: This paper proves that every H-free 3-connected graph (or connected N4-locally connected graph of minimum degree at least three) other than the Petersen graph is supereulerian, and presents an algorithm to find a collapsible subgraph of a graph with girth 4 whose idea is used to prove the following.
3
On hamiltonian properties of K1,r-free split graphs
TL;DR: In this paper , a special type of alternating paths was introduced in the study of split graphs and it was shown that a split graph G is hamiltonian if and only if G is fully cycle extendable.
1