Abstract
It is proved that triangle-free intersection graphs of n L-shapes in the plane have chromatic number O(log log n). This improves the previous bound of......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
