Coloring planar homothets and three-dimensional hypergraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 1256776 (Why is no real title available?)
- Coloring geometric range spaces
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Conflict-free coloring made stronger
- Conflict-free coloring of points and simple regions in the plane
- Decomposing coverings and the planar sensor cover problem
- Dimension and automorphism groups of lattices
- Every planar graph is 5-choosable
- Indecomposable Coverings
- On The Chromatic Number of Geometric Hypergraphs
- On structural and graph theoretic properties of higher order Delaunay graphs
- On the stretch factor of convex Delaunay graphs
- Planar graphs and poset dimension
Cited in
(10)- Extending partial 3-colourings in a planar graph
- Proper coloring of geometric hypergraphs
- On The Chromatic Number of Geometric Hypergraphs
- Proper coloring of geometric hypergraphs
- On 3-colorings of plane graphs
- On 3-hued coloring of graphs
- Coloring Planar Homothets and Three-Dimensional Hypergraphs
- Coloring intersection hypergraphs of pseudo-disks
- 3-dynamic coloring of planar triangulations
- Coloring intersection hypergraphs of pseudo-disks
This page was built for publication: Coloring planar homothets and three-dimensional hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364847)
