Colouring bottomless rectangles and arborescences
DOI10.1016/j.comgeo.2023.102020zbMath1519.05068arXiv1912.05251OpenAlexW2996115425MaRDI QIDQ6110074
Dömötör Pálvölgyi, Torsten Ueckerdt, Piotr Micek, Kolja Knauer, Jean Cardinal, Narmada Varadarajan
Publication date: 31 July 2023
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.05251
Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Coloring half-planes and bottomless rectangles
- Optimally decomposing coverings with translates of a convex polygon
- Coloring axis-parallel rectangles
- Covering the plane with convex polygons
- An on-line graph coloring algorithm with sublinear performance ratio
- Coloring inductive graphs on-line
- Lower bounds for on-line graph coloring
- Coloring points with respect to squares
- Indecomposable coverings with homothetic polygons
- Convex polygons are cover-decomposable
- Online and quasi-online colorings of wedges and intervals
- Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
- Lower Bounds for On-line Graph Colorings
- More on decomposing coverings by octants
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
- Making Octants Colorful and Related Covering Decomposition Problems
- Survey on Decomposition of Multiple Coverings
- Balanced matrices
This page was built for publication: Colouring bottomless rectangles and arborescences
