2 papers
cs.DM2019
A local characterization for perfect plane near-triangulations
Sameera M. Salam, Jasine Babu, K. Murali Krishnan
We derive a local criterion for a plane near-triangulated graph to be perfect. It is shown that a plane near-triangulated graph is perfect if and only if it does not contain either…
cs.CC2011
On the Complexity of Edge Packing and Vertex Packing
Sameera Muhamed Salam, K. N. Parvathy, K. S. Sudeep +1
This paper studies the computational complexity of the Edge Packing problem and the Vertex Packing problem. The edge packing problem (denoted by ) and the vertex packing…