67 citations · 377 across the 34 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.CO2024★ 1 cited
Polynomial-time recognition and maximum independent set in Burling graphs
Paweł Rzążewski, Bartosz Walczak
A Burling graph is an induced subgraph of some graph in Burling's construction of triangle-free high-chromatic graphs. Equivalently, a Burling graph is a graph that admits a so-cal…
math.CO2024★ 1 cited
Excluding a clique or a biclique in graphs of bounded induced matching treewidth
Tara Abrishami, Marcin Briański, Jadwiga Czyżewska +4
For a tree decomposition of a graph , let denote the maximum size of an induced matching in with the property that some bag of c…