Coloring Curves That Cross a Fixed Curve

Authors Alexandre Rok, Bartosz Walczak

Thumbnail PDF


  • Filesize: 0.5 MB
  • 15 pages

Document Identifiers

Author Details

Alexandre Rok
Bartosz Walczak

Cite AsGet BibTex

Alexandre Rok and Bartosz Walczak. Coloring Curves That Cross a Fixed Curve. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 56:1-56:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


We prove that for every integer t greater than or equal to 1, the class of intersection graphs of curves in the plane each of which crosses a fixed curve in at least one and at most t points is chi-bounded. This is essentially the strongest chi-boundedness result one can get for this kind of graph classes. As a corollary, we prove that for any fixed integers k > 1 and t > 0, every k-quasi-planar topological graph on n vertices with any two edges crossing at most t times has O(n log n) edges.
  • String graphs
  • chi-boundedness
  • k-quasi-planar graphs


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads