Abstract
A clique is defined as a complete subgraph maximal under inclusion and having at least two vertices. A clique-transversal set D of a graph G=(V,E) is a subset of vertices of G such that D meets all cliques of G. The clique-transversal set problem is to find a minimum clique-transversal set of G. The clique-transversal set problem has been proved to be NP-complete in planar graphs. This paper gives a polynomial-time algorithm for the clique-transversal set problem in {claw,K4}-free planar graphs.
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.
