67 citations · 145 across the 10 of their papers we have counts for
3 papers · 1 filter
Triangle-free geometric intersection graphs with large chromatic number
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk +4
Several classical constructions illustrate the fact that the chromatic number of a graph can be arbitrarily large compared to its clique number. However, until very recently, no su…
Triangle-free intersection graphs of line segments with large chromatic number
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk +4
In the 1970s, Erdos asked whether the chromatic number of intersection graphs of line segments in the plane is bounded by a function of their clique number. We show the answer is n…
Extending partial representations of function graphs and permutation graphs
Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk +1
Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0,1] and are known to be exactly the complements of comparability gra…