Abstract
AbstractLet be a simple graph and let be two integers with . We prove that for every if and only if has a ‐factor, where denotes the number of isolated vertices of and is a special family of trees. Furthermore, we characterize the trees in in terms of their bipartition.
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 callDisclaimer: 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.
