Bounds on the chromatic number of intersection graphs of sets in the plane (Q1868853)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1901902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds on the chromatic number of intersection graphs of sets in the plane |
scientific article; zbMATH DE number 1901902 |
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
0.8924442529678345
0 references
0.8586450815200806
0 references
0.8586183786392212
0 references
0.8525658249855042
0 references
