Tomasz Krawczyk

activity

20122022

most citedTriangle-free intersection graphs of line segments with large chromatic number

67 citations · 145 across the 10 of their papers we have counts for

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2015

The Partial Visibility Representation Extension Problem

Steven Chaplick, Grzegorz Guśpiel, Grzegorz Gutowski +2

For a graph $G$ , a function $ψ$ is called a \emph{bar visibility representation} of $G$ when for each vertex $v \in V (G)$ , $ψ (v)$ is a horizontal line segment (\emph{bar}) and $uv…

cs.CG2013★ 14 cited

Coloring triangle-free rectangle overlap graphs with $O (lo g lo g n)$ colors

Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak

Recently, it was proved that triangle-free intersection graphs of $n$ line segments in the plane can have chromatic number as large as $Θ (lo g lo g n)$ . Essentially the same constru…

The Partial Visibility Representation Extension Problem

Coloring triangle-free rectangle overlap graphs with O(loglogn) colors

Coloring triangle-free rectangle overlap graphs with $O (lo g lo g n)$ colors