On Cui-Kano's Characterization Problem on Graph Factors
Lu, H. L. · Wang, David G. L.
Original · EN
An Hₙ-factor of a graph G is defined to be a spanning subgraph F of G such that each vertex has degree belonging to the set {1,3,5,...,2n-1,2n} in F. In this paper, we investigate Hₙ-factors of graphs by using Lovász's structural descriptions to the degree prescribed subgraph problem. We find some sufficient conditions for the existence of an Hₙ-factor of a graph. In particular, we make progress on the characterization problem for a special family of graphs proposed by Cui and Kano in 1988.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.