Article citationsMore>>

N. Ananchuen and A. Daito, “Factor Criticality and Complete Closure of Graphs,” Discrete Mathematics, Vol. 265, No. 1-3, 2003, pp. 13-21.

has been cited by the following article:

• TITLE: Some Results on (1,2n – 1)-Odd Factors

  AUTHORS: Man Liu, Qingzhi Yu, Shuling Wang, Changhua Huang

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

  JOURNAL NAME: Applied Mathematics, Vol.3 No.12, December 12, 2012

  ABSTRACT: Let G be a graph. If there exists a spanning subgraph F such that dF(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.