The following pages link to Tara Abrishami (Q2171015):
Displaying 18 items.
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
- Graphs with polynomially many minimal separators (Q2664556) (← links)
- Geometry of Graph Partitions via Optimal Transport (Q5132020) (← links)
- Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree (Q6144405) (← links)
- Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs (Q6144407) (← links)
- Induced subgraphs and tree decompositions V. one neighbor in a hole (Q6199380) (← links)
- Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth (Q6376732) (← links)
- Submodular functions and perfect graphs (Q6504696) (← links)
- Even pairs in Berge graphs with no balanced skew-partitions (Q6509883) (← links)
- Tree independence number I. (Even hole, diamond, pyramid)-free graphs (Q6510289) (← links)
- Excluding a clique or a biclique in graphs of bounded induced matching treewidth (Q6533742) (← links)
- Induced subgraphs of bounded treewidth and the container method (Q6550989) (← links)
- Tree independence number. I. (Even hole, diamond, pyramid)-free graphs (Q6565817) (← links)
- Polynomial-time algorithm for maximum independent set in bounded-degree graphs with no long induced claws (Q6575135) (← links)
- Graphs with no even holes and no sector wheels are the union of two chordal graphs (Q6612305) (← links)
- Induced subgraphs and tree decompositions. VI: Graphs with 2-cutsets (Q6635076) (← links)
- Induced subgraphs and tree decompositions (Q6662683) (← links)
- Periodic colorings and orientations in infinite graphs (Q6751850) (← links)
