12 citations · 76 across the 20 of their papers we have counts for
4 papers · 2 filters
Induced subgraphs and tree-decompositions VII. Basic obstructions in -free graphs
Tara Abrishami, Bogdan Alecu, Maria Chudnovsky +2
We say a class of graphs is clean if for every positive integer there exists a positive integer such that every graph in with treewidth more…
Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets
Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi +1
This paper continues a series of papers investigating the following question: which hereditary graph classes have bounded treewidth? We call a graph -clean if it does not contai…
Induced subgraphs and tree decompositions V. One neighbor in a hole
Tara Abrishami, Bogdan Alecu, Maria Chudnovsky +3
What are the unavoidable induced subgraphs of graphs with large treewidth? It is well-known that the answer must include a complete graph, a complete bipartite graph, all subdivisi…
Induced subgraphs and tree decompositions IV. (Even hole, diamond, pyramid)-free graphs
Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi +1
A hole in a graph is an induced cycle of length at least four, and an even hole is a hole of even length. The diamond is the graph obtained from the complete graph by rem…