Abstract
In this paper, we consider the problem of finding a spanning tree in a graph that maximizes the number of leaves. We show the NP-hardness of this problem for graphs that are planar and cubic. Our proof will be an adaption of the proof for arbitrary cubic graphs in Lemke (1988) [9]. Furthermore, it is shown that the problem is APX-hard on 5-regular graphs. Finally, we extend our proof to k-regular graphs for odd k>5.
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.
