5 papers · 1 filter
Chvátal-Erdős condition for 2-factors with at most two components in graphs
Tao Tian, Liming Xiong, Weigen Yan
It is well-known that Chvátal and Erdős stated that any graph of order at least three whose independence number is no greater than its connectivity is Hamiltonian; that any graph w…
On traceable iterated line graph and hamiltonian path index
Zhaohong Nou, Liming Xiong, Weihua Yang
Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs for which the -th iterated lin…
Forbidden pairs for equality of edge-connectivity and minimum degree
Junfeng Du, Ziwen Huang, Liming Xiong
Let be a class of given graphs. A graph is said to be -free if contains no induced copies of for any . In this article, we…
Connected even factors in the square of essentially 2-edge connected graphs
Jan Ekstein, Baoyindureng Wu, Liming Xiong
In this paper we prove that the square of an essentially 2-edge connected graph with an additional property has a connected even factor with maximum degree at most 4. Moreover we s…
Star subdivisions and connected even factors in the square of a graph
Jan Ekstein, Přemysl Holub, Tomáš Kaiser +2
For any positive integer , a -factor in a graph is a connected even factor with maximum degree at most . We prove that if every induced in a gra…