
Grounded Lgraphs are polynomially χbounded
A grounded Lgraph is the intersection graph of a collection of "L" shap...
read it

Distinguishing classes of intersection graphs of homothets or similarities of two convex disks
For smooth convex disks A, i.e., convex compact subsets of the plane wit...
read it

Colouring polygon visibility graphs and their generalizations
Curve pseudovisibility graphs generalize polygon and pseudopolygon vis...
read it

Approximating pathwidth for graphs of small treewidth
We describe a polynomialtime algorithm which, given a graph G with tree...
read it

Coloring and Maximum Weight Independent Set of Rectangles
In 1960, Asplund and Grünbaum proved that every intersection graph of ax...
read it

Coloring trianglefree Lgraphs with O(loglog n) colors
It is proved that trianglefree intersection graphs of n Lshapes in the...
read it

Subexponentialtime algorithms for finding large induced sparse subgraphs
Let C and D be hereditary graph classes. Consider the following problem:...
read it

Planar graphs have bounded nonrepetitive chromatic number
A colouring of a graph is "nonrepetitive" if for every path of even orde...
read it

Realization of shift graphs as disjointness graphs of 1intersecting curves in the plane
It is shown that shift graphs can be realized as disjointness graphs of ...
read it

Sparse Kneser graphs are Hamiltonian
For integers k≥ 1 and n≥ 2k+1, the Kneser graph K(n,k) is the graph whos...
read it
Bartosz Walczak
is this you? claim profile