Making triangles colorful
From MaRDI portal
Publication:2968105
DOI10.20382/jocg.v4i1a10zbMath1422.52007arXiv1212.2346OpenAlexW2963020478MaRDI QIDQ2968105
Kolja Knauer, Jean Cardinal, Piotr Micek, Torsten Ueckerdt
Publication date: 9 March 2017
Full work available at URL: https://arxiv.org/abs/1212.2346
Computational aspects related to convexity (52B55) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Related Items (5)
Unsplittable coverings in the plane ⋮ Coloring points with respect to squares ⋮ Convex polygons are self-coverable ⋮ An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes ⋮ Proper coloring of geometric hypergraphs
This page was built for publication: Making triangles colorful
