3 papers
cs.DM2021
On the Kernel and Related Problems in Interval Digraphs
Mathew C. Francis, Pavol Hell, Dalu Jacob
Given a digraph , a set is said to be absorbing set (resp. dominating set) if every vertex in the graph is either in or is an in-neighbour (resp. out-neigh…
cs.DM2019
The Lexicographic Method for the Threshold Cover Problem
Mathew C. Francis, Dalu Jacob
Threshold graphs are a class of graphs that have many equivalent definitions and have applications in integer programming and set packing problems. A graph is said to have a thresh…
cs.DM2016
Uniquely Restricted Matchings in Interval Graphs
Mathew C. Francis, Dalu Jacob, Satyabrata Jana
A matching in a graph is said to be uniquely restricted if there is no other matching in that matches the same set of vertices as . We describe a polynomial-time alg…