Abstract
In this paper, we consider whether the vertices of graph G can be partitioned into K subsets V 1, V 2, ... V K so that for each i ? {1,...,K}, the subgraph induced by V i is a perfect matching where K ≤ ? V ?. It is known that it is an NP complete problem in general graphs. In this paper, we restrict the problem in Halin graphs and give an algorithm to find the minimum value of K (2 ≤ K ≤ 4) in Halin graphs. The time complexity is O(n).
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.
