科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let k be an integer with k a parts per thousand yen 2 and G a graph with order n > 4k. We prove that if the minimum degree sum of any two nonadjacent vertices is at least n + k, then G contains a vertex cover with exactly k components such that k-1 of them are chorded 4-cycles. The degree condition is sharp in general.
