Now showing items 1-3 of 3

    • Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. 

      Abrishami, Tara; Chudnovsky, Maria; Dibek, Cemil; Hajebi, Sepehr; Rzqzewski, Pawel; Spirkl, Sophie; Vuskovic, Kristina (Elsevier, 2024-01)
      This paper is motivated by the following question: what are the unavoidable induced subgraphs of graphs with large treewidth? Aboulker et al. made a conjecture which answers this question in graphs of bounded maximum ...
    • Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs. 

      Abrishami, Tara; Alecu, Bogdan; Chudnovsky, Maria; Hajebi, Sepehr; Spirkl, Sophie (Elsevier, 2024-01)
      We say a class C of graphs is clean if for every positive integer t there exists a positive integer w(t) such that every graph in C with treewidth more than w(t) contains an induced subgraph isomorphic to one of the ...
    • Tree independence number I. (Even hole, diamond, pyramid)-free graphs 

      Abrishami, Tara; Alecu, Bogdan; Chudnovsky, Maria; Hajebi, Sepehr; Spirkl, Sophie; Vuskovic, Kristina (Wiley, 2024-04-24)
      The tree‐independence number tree‐α, first defined and studied by Dallard, Milanič, and Štorgel, is a variant of treewidth tailored to solving the maximum independent set problem. Over a series of papers, Abrishami et al. ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages