3 papers
math.CO2025
The Hamiltonian properties of rectangular meshes with at most two faulty nodes
Yingtai Xie
In this paper we consider the Hamilton cycle problem in the rectangular meshes with at most two faulty nodes.We prove that this problem is solvable in polynomial time with a corres…
math.CO2022
A Efficient Algorithm For Computing k-Factor
Yingtai Xie
This article will prove a theorem for the existence of k-factor for k>1 ,and present an efficient algorithm for computing k-factor for all values of k based on this theorem.
math.CO2011
A Graph Invariant and 2-factorizations of a graph
Yingtai Xie
A spanning subgraph of a graph G is called a [0,2]-factor of G, if for . is a union of some disjoint cycles, paths and isolate vertices, that span the graph G. It is easy to get a…