Abstract
If π is a property on graphs, the corresponding edge deletion (edge contraction, respectively) problem is: Given a graph G, determine the minimum number of edges of G whose deletion (contraction) results in a graph satisfying property π. We show that these problems are NP-hard if π is finitely characterizable by 3-connected graphs.
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.
