1 citations · 2 across the 3 of their papers we have counts for
9 papers
Grounded L-graphs are polynomially -bounded
James Davies, Tomasz Krawczyk, Rose McCarty +1
A grounded L-graph is the intersection graph of a collection of "L" shapes whose topmost points belong to a common horizontal line. We prove that every grounded L-graph with clique…
Colouring polygon visibility graphs and their generalizations
James Davies, Tomasz Krawczyk, Rose McCarty +1
Curve pseudo-visibility graphs generalize polygon and pseudo-polygon visibility graphs and form a hereditary class of graphs. We prove that every curve pseudo-visibility graph with…
Degeneracy of -free and -free graphs with no large complete bipartite subgraphs
Marthe Bonamy, Nicolas Bousquet, Michał Pilipczuk +3
A hereditary class of graphs is \emph{-bounded} if there exists a function such that every graph satisfies , where $χ(G)…
Coloring and Maximum Weight Independent Set of Rectangles
Parinya Chalermsook, Bartosz Walczak
In 1960, Asplund and Grünbaum proved that every intersection graph of axis-parallel rectangles in the plane admits an -coloring, where is the maximum size of a clique.…
Coloring triangle-free L-graphs with colors
Bartosz Walczak
It is proved that triangle-free intersection graphs of L-shapes in the plane have chromatic number . This improves the previous bound of (McGuinness,…
Subexponential-time algorithms for finding large induced sparse subgraphs
Jana Novotná, Karolina Okrasa, Michał Pilipczuk +3
Let and be hereditary graph classes. Consider the following problem: given a graph , find a largest, in terms of the number of vertices…