A degree condition for the existence ofk-factors with prescribed properties
2005 ◽
Vol 2005
(6)
◽
pp. 863-873
◽
Letkbe an integer such thatk≥3, and letGbe a 2-connected graph of ordernwithn≥4k+1,kneven, and minimum degree at leastk+1. We prove that if the maximum degree of each pair of nonadjacent vertices is at leastn/2, thenGhas ak-factor excluding any given edge. The result of Nishimura (1992) is improved.
Keyword(s):
1980 ◽
Vol 32
(6)
◽
pp. 1325-1332
◽
Keyword(s):
2021 ◽
Vol vol. 23 no. 1
(Graph Theory)
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
1972 ◽
Vol 24
(5)
◽
pp. 805-807
◽
Keyword(s):