Abstract
By the famous Four Color Theorem, every planar graph admits an independent set that contains at least one quarter of its vertices. This lower bound is tight for infinitely many planar graphs, and finding maximum independent sets in planar graphs is \(\mathsf {NP}\)-hard. A well-known open question in the field of Parameterized Complexity asks whether the problem of finding a maximum independent set in a given planar graph is fixed-parameter tractable, for parameter the “gain” over this tight lower bound. This open problem has been posed many times [4, 8, 10, 13, 17, 20, 31, 32, 35, 38].
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.
