Abstract
An Hn-factor of a graph G is defined to be a spanning subgraph F of G such that each vertex has a degree belonging to the set {1,3,5,.,2n-1,2n} in F, where n≥2. In this article, we investigate Hn-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 Hn-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.
Original language | English |
---|---|
Pages (from-to) | 335-343 |
Number of pages | 9 |
Journal | Journal of Graph Theory |
Volume | 74 |
Issue number | 3 |
DOIs | |
Publication status | Published - Nov 2013 |
Externally published | Yes |
Keywords
- Lovász's structural description