Sizhong Zhou and Bingyuan Pu
a, bFactors Excluding Some Specified Edges In Graphs
1017 - 1019
2009
3
11
International Journal of Mathematical and Computational Sciences
https://publications.waset.org/pdf/3455
https://publications.waset.org/vol/35
World Academy of Science, Engineering and Technology
Let G be a graph of order n, and let a, b and m be positive integers with 1 &le; a&lt;b. An a, bfactor of G is dened as a spanning subgraph F of G such that a &le; dF (x) &le; b for each x &isin; V (G). In this paper, it is proved that if n &ge; (ab&minus;1&radic;(ab1)m&minus;2)2&minus;1 b and &delta;(G) &gt; n a b &minus; 2 &radic;bn 1, then for any subgraph H of G with m edges, G has an a, bfactor F such that E(H)&cap; E(F) &empty;. This result is an extension of thatof Egawa 2.
Open Science Index 35, 2009