Showing cs.DMShow all
2 papers · 1 filter
cs.DM2026
Maximum Edge Open Packing in Permutation, Interval, and Well-Partitioned Chordal Graphs
Gautam K. Das, Kamal Santra
Edge open packing is a relaxation of induced matching in which the selected edges may induce disjoint stars. We study the \textsc{Maximum Edge Open Packing} problem on permutation…
cs.DM2026
Roman-Type Domination on Convex and Chordal Bipartite Graphs: Algorithms and Hardness
Gautam K. Das, Kamal Santra
Roman domination and its variants form an important family of domination-type graph parameters motivated by protection, fault tolerance, and resource allocation. A Roman dominating…