67 citations · 377 across the 34 of their papers we have counts for
4 papers · 1 filter
Coloring curves that cross a fixed curve
Alexandre Rok, Bartosz Walczak
We prove that for every integer , the class of intersection graphs of curves in the plane each of which crosses a fixed curve in at least one and at most points is …
Graph drawings with one bend and few slopes
Kolja Knauer, Bartosz Walczak
We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of these…
Dimension and cut vertices: an application of Ramsey theory
William T. Trotter, Bartosz Walczak, Ruidong Wang
Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every ,…
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…