par Cardinal, Jean ;Korman, Matias
Référence Lecture notes in computer science, 7256 LNCS, page (121-132)
Publication Publié, 2012
Article révisé par les pairs
Résumé : We prove that every finite set of homothetic copies of a given compact and convex body in the plane can be colored with four colors so that any point covered by at least two copies is covered by two copies with distinct colors. This generalizes a previous result from Smorodinsky (SIAM J. Disc. Math. 2007). Then we show that for any κ ≥ 2, every three-dimensional hypergraph can be colored with 6(κ-1) colors so that every hyperedge e contains min {