Abstract
Let , and be three integers such that . Let be a -regular, -edge-connected graph of odd order. We obtain some sufficient conditions, which guarantee contains a -factor for all .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.