Abstract
Abstract In this paper, we investigate existence of triangle-factors, that is 2-factors in which every cycle is of length 3, in powers of graphs of order 3 k , k ≥ 1. It is easy to show that G 4 contains a triangle-factor for any connected graph and G 3 contains a triangle-factor for any connected claw-free graph G Our main result is that G 3 contains a triangle-factor for any 2-connected graph G. We also show, using the same method, that any 2-connected claw-free graph contains a P 3 -factor which implies that the square of the graph contains a triangle-factor.
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.
