A degree condition for the existence of k -factors with prescribed properties

Changping Wang

International Journal of Mathematics and Mathematical Sciences, 2005, vol. 2005, 1-11

Abstract:

Let k be an integer such that k ≥ 3 , and let G be a 2-connected graph of order n with n ≥ 4 k + 1 , k n even, and minimum degree at least k + 1 . We prove that if the maximum degree of each pair of nonadjacent vertices is at least n / 2 , then G has a k -factor excluding any given edge. The result of Nishimura (1992) is improved.

Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2005/710518.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2005/710518.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:710518

DOI: 10.1155/IJMMS.2005.863

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().