Some results on odd factors of graphs
Cui Yuting, Mikio Kanō · Journal of Graph Theory · 1988
Abstract A {1, 3, …,2n − 1}‐factor of a graph G is defined to be a spanning subgraph of G, each degree of whose vertices is one of {1, 3, …, 2n − 1}, where n is a positive integer. In this paper, we give a sufficient condition for a graph to have a {1, 3, …, 2n − 1}‐factor.