Abstract
A Pk-factor H of G is a spanning subgraph of G such that each component of H is a path of k vertices, where k≥2. In this paper, we obtain two necessary conditions for Pk-factors in the squares and line graphs of trees, respectively. It is shown that the results are best possible in some sense. Furthermore, we give a characterization for a class of trees whose line graphs contain P4-factors.
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 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.
