Sign in

Coloring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors.

Tomasz KrawczykArkadiusz PawlikBartosz Walczak
Published in: Discret. Comput. Geom. (2015)
Keyphrases
  • log log
  • worst case
  • positive integer
  • lower bound
  • website
  • real time
  • data sets
  • decision trees
  • color images
  • random graphs