112 citations · 144 across the 30 of their papers we have counts for
35 papers
Face-hitting Dominating Sets in Planar Graphs
P. Francis, Abraham M. Illickan, Lijo M. Jose +1
A dominating set of a graph is a subset of its vertices such that each vertex of not in has a neighbor in . A face-hitting set of a plane graph is a set …
Arborescences and Shortest Path Trees when Colors Matter
P. S. Ardra, Jasine Babu, Kritika Kashyap +3
Color-constrained subgraph problems are those where we are given an edge-colored (directed or undirected) graph and the task is to find a specific type of subgraph, like a spanning…
B-VPG Representation of AT-free Outerplanar Graphs
Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad
A -bend path is a non-self-intersecting polyline in the plane made of at most axis-parallel line segments. B-VPG is the class of graphs which can be represented as int…
Disjoint Total Dominating Sets in Near-Triangulations
P. Francis, Abraham M. Illickan, Lijo M. Jose +1
We show that every simple planar near-triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulati…
Improved Bounds for the Oriented Radius of Mixed Multigraphs
Jasine Babu, Deepu Benson, Deepak Rajendraprasad
A mixed multigraph is a multigraph which may contain both undirected and directed edges. An orientation of a mixed multigraph is an assignment of exactly one direction to each…
On Domatic and Total Domatic Numbers of Product Graphs
P. Francis, Deepak Rajendraprasad
A \emph{domatic} (\emph{total domatic}) \emph{-coloring} of a graph is an assignment of colors to the vertices of such that each vertex contains vertices of all …