Author(s)

Man Liu, Qingzhi Yu, Shuling Wang, Changhua Huang

Aerial Four Station Department, Air Force Logistics College, Xuzhou, China.
Department of Basic Course, Air Force Logistics College, Xuzhou, China.

Let G be a graph. If there exists a spanning subgraph F such that d_F(x) ∈ {1,3,…2n – 1}, then is called to be (1,2n – 1)-odd factor of G. Some sufficient and necessary conditions are given for G – U to have (1,2n – 1)-odd factor where U is any subset of V(G) such that |U| = k.

Claw Free Graphs; (1, 2n – 1)-Odd Factor; Factor-Criticality

M. Liu, Q. Yu, S. Wang and C. Huang, "Some Results on (1,2n – 1)-Odd Factors," Applied Mathematics, Vol. 3 No. 12, 2012, pp. 1874-1876. doi: 10.4236/am.2012.312255.