Abstract

AbstractApath partition(also referred to as a linear forest) of a graph is a set of vertex‐disjoint paths which together contain all the vertices of . An isolated vertex is considered to be a path in this case. The path partition conjecture states that every ‐vertex ‐regular graph has a path partition with at most paths. The conjecture has been proved for all . We prove the conjecture for .

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 call

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.