Colorful strips

DOI10.1007/s00373-011-1014-5zbMath1235.05047OpenAlexW2913152938MaRDI QIDQ659707

Greg Aloupis, Shakhar Smorodinsky, Perouz Taslakian, Stefan Langerman, Jean Cardinal, Shinji Imahori, Matias Korman, Oded Schwartz, Sébastien Collette

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1014-5

zbMATH Keywords

Computational geometryLovász local lemmaCovering decompositionHypergraph coloring

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Polychromatic colorings of unions of geometric hypergraphs ⋮ Polychromatic coloring for half-planes ⋮ Rainbow polygons for colored point sets in the plane

Cites Work

• Decomposition of multiple coverings into more parts
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• A simple algorithm for edge-coloring bipartite multigraphs
• Coloring geometric range spaces
• Covering the plane with convex polygons
• Bounded size components -- partitions and transversals.
• Multiple coverings of the plane with triangles
• On The Chromatic Number of Geometric Hypergraphs
• A constructive proof of the general lovász local lemma
• Towards an implementation of the 3D visibility skeleton
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Decomposing Coverings and the Planar Sensor Cover Problem
• The complexity of satisfiability problems
• Indecomposable Coverings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Colorful strips