4 papers
Asymmetric induced saturation
Xinyue Fan, Sahab Hajebi, Sepehr Hajebi +1
For which graphs does there exist a graph with at least one edge and no induced subgraph isomorphic to , such that deleting any edge of creates an induced copy of $H…
Halfway to induced saturation for even cycles
Xinyue Fan, Sahab Hajebi, Sepehr Hajebi +1
For graphs and , we say that is -free if no induced subgraph of is isomorphic to , and that is -induced-saturated if is -free but removing or add…
Parameterized Complexity of the Star Decomposition Problem
Sahab Hajebi, Ramin Javadi
A star of length is defined as the complete bipartite graph . In this paper we deal with the problem of edge decomposition of graphs into stars of varying l…
On the Parameterized Complexity of the Acyclic Matching Problem
Sahab Hajebi, Ramin Javadi
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph…