12 citations · 76 across the 20 of their papers we have counts for
3 papers · 1 filter
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree
Tara Abrishami, Maria Chudnovsky, Kristina Vušković
Treewidth is a parameter that emerged from the study of minor closed classes of graphs (i.e. classes closed under vertex and edge deletion, and edge contraction). It in some sense…
Graphs with polynomially many minimal separators
Tara Abrishami, Maria Chudnovsky, Cemil Dibek +3
We show that graphs that do not contain a theta, pyramid, prism, or turtle as an induced subgraph have polynomially many minimal separators. This result is the best possible in the…
Induced subgraphs of bounded treewidth and the container method
Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk +2
A hole in a graph is an induced cycle of length at least 4. A hole is long if its length is at least 5. By we denote a path on vertices. In this paper we give polynomial-…