Browsing Waterloo Research by Author "Hajebi, Sepehr"

Now showing items 1-3 of 3

Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph

Hajebi, Sepehr; Li, Yanjia; Spirkl, Sophie (Society for Industrial and Applied Mathematics, 2022-08-30)

For a positive integer r and graphs G and H, we denote by G+H the disjoint union of G and H and by rH the union of r mutually disjoint copies of H. Also, we say G is H-free if H is not isomorphic to an induced subgraph of ...
Induced Subgraphs and Tree Decompositions III. Three-Path-Configurations and Logarithmic Treewidth.

Abrishami, Tara; Chudnovsky, Maria; Hajebi, Sepehr; Spirkl, Sophie (Advances in Combinatorics, 2022-09-09)

A theta is a graph consisting of two non-adjacent vertices and three internally disjoint paths between them, each of length at least two. For a family H of graphs, we say a graph G is H-free if no induced subgraph of G is ...
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs

Cheriyan, Joseph; Hajebi, Sepehr; Qu, Zishen; Spirkl, Sophie (Elsevier, 2022-07)

In 1981, Duffus, Gould, and Jacobson showed that every connected graph either has a Hamiltonian path, or contains a claw (K1,3) or a net (a fixed six-vertex graph) as an induced subgraph. This implies that subject to being ...