Abstract
A {1,3,...,2n?1}-factor of a graphG is defined to be a spanning subgraph ofG each degree of whose vertices is one of {1,3,...,2n?1}, wheren is a positive integer. In this paper, we give criterions for the existence of a {1,3,...,2n?1}-factor in a tree and in a graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
