67 citations · 377 across the 34 of their papers we have counts for
4 papers · 1 filter
A solution to Ringel's circle problem
James Davies, Chaya Keller, Linda Kleist +2
We construct families of circles in the plane such that their tangency graphs have arbitrarily large girth and chromatic number. This provides a strong negative answer to Ringel's…
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…
Distinguishing classes of intersection graphs of homothets or similarities of two convex disks
Mikkel Abrahamsen, Bartosz Walczak
For smooth convex disks , i.e., convex compact subsets of the plane with non-empty interior and with at most one tangent at every boundary point, we classify the classes $G^{\te…
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…