Article citationsMore>>

T. Iida and T. Nishimura, “An Ore-Type Conditions for the Existence of k-Factors in Graphs,” Graphs and Combinatorics, Vol. 7, No. 4, 1991, pp. 353-361. http://dx.doi.org/10.1007/BF01787640

has been cited by the following article:

• TITLE: A Neighborhood Condition for Graphs to Have Special [a,b]-Factor

  AUTHORS: Jinguo Lei, Qingzhi Yu, Changhua Huang, Man Liu

  KEYWORDS: Graph; Factor; [a, b]-Factor; The Minimum Degree; Neighborhood Condition

  JOURNAL NAME: Applied Mathematics, Vol.5 No.1, January 16, 2014

  ABSTRACT: Let G be a graph of order n, and let a and b be integers, such that 1 ≤ a b. Let H be a subgraph of G with m(≤b) edges, and δ(G) be the minimum degree. We prove that G has a [a,b]-factor containing all edges of H if , , and when a ≤ 2, .