Bounds on the chromatic number of intersection graphs of sets in the plane (Q1868853): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(02)00501-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078773442 / rank | |||
Normal rank | |||
Latest revision as of 11:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on the chromatic number of intersection graphs of sets in the plane |
scientific article |
Statements
Bounds on the chromatic number of intersection graphs of sets in the plane (English)
0 references
28 April 2003
0 references
It is shown that the chromatic number of intersection graphs of congruent geometric figures obtained by translations of a fixed figure in the plane is bounded by the clique number. Further, it is proved that the triangle-free intersection graph of a finite number of compact connected sets with piecewise differentiable Jordan curve boundaries is planar and hence, is 3-colorable.
0 references
coloring
0 references
intersection graph
0 references
clique number
0 references
compact connected set
0 references
