2 citations · 3 across the 2 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2021★ 1 cited
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…
math.CO2021
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…
math.CO2015
Asymmetric coloring games on incomparability graphs
Tomasz Krawczyk, Bartosz Walczak
Consider the following game on a graph : Alice and Bob take turns coloring the vertices of properly from a fixed set of colors; Alice wins when the entire graph has been col…