Recommendations
Cites work
- Coloring Planar Homothets and Three-Dimensional Hypergraphs
- Convex polygons are cover-decomposable
- Covering the plane with convex polygons
- Deciding soccer scores and partial orientations of graphs
- Decomposing coverings and the planar sensor cover problem
- Decomposition of multiple coverings into more parts
- scientific article; zbMATH DE number 6381738 (Why is no real title available?)
- scientific article; zbMATH DE number 3692179 (Why is no real title available?)
- scientific article; zbMATH DE number 3060538 (Why is no real title available?)
- Indecomposable Coverings
- Indecomposable coverings with concave polygons
- Multiple coverings of the plane with triangles
- Survey on decomposition of multiple coverings
- Weighted geometric set cover via quasi-uniform sampling
Cited in
(17)- Coloring points with respect to squares
- Coloring Delaunay-edges and their generalizations
- Coloring intersection hypergraphs of pseudo-disks
- Proper coloring of geometric hypergraphs
- Indecomposable coverings with homothetic polygons
- Octants are cover-decomposable into many coverings
- Online and quasi-online colorings of wedges and intervals
- An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
- Octants are cover decomposable
- More on decomposing coverings by octants
- Coloring intersection hypergraphs of pseudo-disks
- Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
- Making Octants Colorful and Related Covering Decomposition Problems
- Making octants colorful and related covering decomposition problems
- Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
- Realizing an m-uniform four-chromatic hypergraph with disks
- Convex polygons are self-coverable
This page was built for publication: Octants are cover-decomposable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411409)
