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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
