12 citations · 55 across the 33 of their papers we have counts for
42 papers
An approximation algorithm for zero forcing
Ben Cameron, Jeannette Janssen, Rogers Matthew +1
We give an algorithm that finds a zero forcing set which approximates the optimal size by a factor of , where is the pathwidth of . Starting from…
Extremal Results on Conflict-free Coloring
Sriram Bhyravarapu, Shiwali Gupta, Subrahmanyam Kalyanasundaram +1
A conflict-free open neighborhood coloring of a graph is an assignment of colors to the vertices such that for every vertex there is a color that appears exactly once in its open n…
Flexible list colorings: Maximizing the number of requests satisfied
Hemanshu Kaul, Rogers Mathew, Jeffrey A. Mudrock +1
Flexible list coloring was introduced by Dvořák, Norin, and Postle in 2019. Suppose , is a graph, is a list assignment for , and is a function with n…
On hierarchically closed fractional intersecting families
Niranjan Balachandran, Srimanta Bhattacharya, Krishn Vishwas Kher +2
For a set of positive proper fractions and a positive integer , a fractional -closed -intersecting family is a collection …
Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority gates
Mathew C. Francis, Atrayee Majumder, Rogers Mathew
A graph on vertices is a \emph{threshold graph} if there exist real numbers and such that the zero-one solutions of the linear inequality $\sum \…
Conflict-free coloring on open neighborhoods of claw-free graphs
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
The `Conflict-Free Open (Closed) Neighborhood coloring', abbreviated CFON (CFCN) coloring, of a graph using colors is a coloring of the vertices of such that every vert…