1 citations · 1 across the 2 of their papers we have counts for
6 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…
Box and segment intersection graphs with large girth and chromatic number
James Davies
We prove that there are intersection graphs of axis-aligned boxes in and intersection graphs of straight lines in that have arbitrarily large girth an…
Locally Hamiltonian graphs and minimal size of maximal graphs on a surface
James Davies, Carsten Thomassen
We prove that every locally Hamiltonian graph with vertices and possibly with multiple edges has at least edges with equality if and only if it triangulates the sph…
Edge-maximal graphs on orientable and some non-orientable surfaces
James Davies, Florian Pfender
We study edge-maximal, non-complete graphs on surfaces that do not triangulate the surface. We prove that there is no such graph on the projective plane , is…
Circle graphs are quadratically -bounded
James Davies, Rose McCarty
We prove that the chromatic number of a circle graph with clique number is at most .