Outerstring graphs are χ-bounded

DOI10.1145/2582112.2582115zbMath1395.05063arXiv1312.1559OpenAlexW2118155424MaRDI QIDQ4635536

Alexandre Rok, Bartosz Walczak

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1559

zbMATH Keywords

chromatic numbergeometric intersection graphs\(\chi\)-boundednessouterstring graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (11)

Cops and robbers on intersection graphs ⋮ Intersection Graphs of Rays and Grounded Segments ⋮ Coloring curves that cross a fixed curve ⋮ New bounds on the maximum number of edges in \(k\)-quasi-planar graphs ⋮ Coloring intersection graphs of arc-connected sets in the plane ⋮ Refining the hierarchies of classes of geometric intersection graphs ⋮ Conflict-free coloring of string graphs ⋮ Unnamed Item ⋮ On-line approach to off-line coloring problems on graphs with geometric representations ⋮ On grounded \(\llcorner\)-graphs and their relatives ⋮ On the chromatic number of disjointness graphs of curves

This page was built for publication: Outerstring graphs are χ-bounded