On the chromatic number of intersection graphs of convex sets in the plane

zbMath1054.05040MaRDI QIDQ1883668

Kittikorn Nakprasit, Seog-Jin Kim, Alexandr V. Kostochka

Publication date: 13 October 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124092

zbMATH Keywords

convex setsintersection graphchromatic numberclique number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Triangle-free geometric intersection graphs with large chromatic number ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ Coloring intersection graphs of arc-connected sets in the plane ⋮ Coloring the complements of intersection graphs of geometric figures ⋮ Quadratic forms on graphs ⋮ Coloring translates and homothets of a convex body ⋮ Domination in Geometric Intersection Graphs ⋮ Outerstring Graphs are $\chi$-Bounded

This page was built for publication: On the chromatic number of intersection graphs of convex sets in the plane