Coloring intersection hypergraphs of pseudo-disks

DOI10.1007/S00454-019-00142-6MaRDI QIDQ2207604zbMATH OpenOpenAlexWikidataFDO

Authors Balázs Keszegh

Publication date 23 October 2020

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00454-019-00142-6

zbMATH Keywords

Delaunay-graphgeometric hypergraph coloringintersection hypergraphpseudo-disksregions with linear union complexity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Coloring intersection hypergraphs of pseudo-disks
• On The Chromatic Number of Geometric Hypergraphs
• Proper coloring of geometric hypergraphs
• Proper coloring of geometric hypergraphs
• Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs

Cites work

• A finite family of pseudodiscs must include a ``small pseudodisc
• Adjacent crossings do matter
• An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
• Applications of random sampling in computational geometry. II
• Approximation algorithms for maximum independent set of pseudo-disks
• Coloring half-planes and bottomless rectangles
• Coloring planar homothets and three-dimensional hypergraphs
• Coloring points with respect to squares
• Conflict-free coloring and its applications
• Conflict-free coloring of intersection graphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Indecomposable Coverings
• Indecomposable coverings with homothetic polygons
• Lenses in arrangements of pseudo-circles and their applications
• More on decomposing coverings by octants
• Octants are cover-decomposable
• On the boundary of the union of planar convex sets
• On The Chromatic Number of Geometric Hypergraphs
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Proper coloring of geometric hypergraphs
• Survey on decomposition of multiple coverings
• Topological hypergraphs
• Toward a theory of crossing numbers
• Über wesentlich unplättbare Kurven im dreidimensionalen Raume

Cited in

(12)

• Discrete Helly-type theorems for pseudohalfplanes
• On the number of hyperedges in the hypergraph of lines and pseudo-discs
• The \(\varepsilon\)-\(t\)-net problem
• On The Chromatic Number of Geometric Hypergraphs
• Proper coloring of geometric hypergraphs
• Coloring intersection hypergraphs of pseudo-disks
• Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
• Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
• On hypergraph supports (extended abstract)
• Pushing the frontiers of subexponential FPT time for feedback vertex set
• On supports for graphs of bounded genus
• On pseudo-disk hypergraphs

This page was built for publication: Coloring intersection hypergraphs of pseudo-disks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2207604)