Browsing Waterloo Research by Subject "even-hole-free graphs"
Now showing items 1-1 of 1
-
Tree independence number I. (Even hole, diamond, pyramid)-free graphs
(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. ...