Abstract
It is well known that it is NP-hard to determine the minimum number of components of a 2-factor in a graph, even for iterated line graphs. In this paper, we determine the minimum number of components of 2-factors in iterated line graphs of some special tree-like graphs. It extends some known results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Bulletin of the Malaysian Mathematical Sciences Society
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.