论文信息 - Coloring the complements of intersection graphs of geometric figures

Coloring the complements of intersection graphs of geometric figures

Let [email protected]? be the complement of the intersection graph G of a family of translations of a compact convex figure in R^n. When n=2, we show that @g([email protected]?)==3. We also study the chromatic number of the complement of the intersection graph of homothetic copies of a fixed convex body in R^n.

Seog-Jin Kim | Kittikorn Nakprasit

[1] Alexandr V. Kostochka,et al. Colouring triangle-free intersection graphs of boxes on the plane , 2000, Discret. Math..

[2] A. Gräf,et al. On Coloring Unit Disk Graphs , 1998, Algorithmica.

[3] Irina G. Perepelitsa. Bounds on the chromatic number of intersection graphs of sets in the plane , 2003, Discret. Math..

[4] Alexandr V. Kostochka,et al. On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane , 2004, Electron. J. Comb..

[5] H. Minkowski. Dichteste gitterförmige Lagerung kongruenter Körper , 1904 .

[6] Alexandr V. Kostochka,et al. Covering boxes by points , 1993, Discret. Math..

[7] Seog-Jin Kim,et al. Transversal numbers of translates of a convex body , 2006, Discret. Math..

[8] Alexandr V. Kostochka,et al. Coloring intersection graphs of geometric figures with a given clique number , 2004 .

[9] Gy. K árolyi. On point covers of parallel rectangles , 1991 .

[10] Branko Grünbaum,et al. On a Coloring Problem. , 1960 .

[11] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..

[12] András Gyárfás,et al. Covering and coloring problems for relatives of intervals , 1985, Discret. Math..