1 citations · 1 across the 7 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2026
3-packings in Triangulations: Algorithms, bounds, and Complexity
Prosenjit Bose, Anil Maheshwari, Bobby Miraftab +1
We study -packings in plane triangulations for the three-vertex graphs . For a graph , let denote the maximum size of an -packing in…
cs.DM2024
On 1-Planar Graphs with Bounded Cop-Number
Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari +1
Cops and Robbers is a type of pursuit-evasion game played on a graph where a set of cops try to capture a single robber. The cops first choose their initial vertex positions, and l…
cs.DM2023★ 1 cited
On Separating Path and Tree Systems in Graphs
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel +6
We explore the concept of separating systems of vertex sets of graphs. A separating system of a set is a collection of subsets of such that for any pair of distinct element…