Bounds on the chromatic number of intersection graphs of sets in the plane

DOI10.1016/S0012-365X(02)00501-0zbMath1012.05065OpenAlexW2078773442MaRDI QIDQ1868853

I. G. Perepelitsa

Publication date: 28 April 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00501-0

zbMATH Keywords

intersection graphclique numbercoloringcompact connected set

Mathematics Subject Classification ID

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

Related Items (4)

Coloring the complements of intersection graphs of geometric figures ⋮ Coloring translates and homothets of a convex body ⋮ On rectangle intersection graphs with stab number at most two ⋮ Improved Ramsey-type results for comparability graphs

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