9 citations · 17 across the 9 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2022
Eternal vertex cover number of maximal outerplanar graphs
Jasine Babu, K. Murali Krishnan, Veena Prabhakaran +1
Eternal vertex cover problem is a variant of the classical vertex cover problem modeled as a two player attacker-defender game. Computing eternal vertex cover number of graphs is k…
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…