A note on coloring line arrangements
zbMATH Open1300.05088MaRDI QIDQ405217FDOQ405217
Authors: Eyal Ackerman, János Pach, Rom Pinchasi, Radoš Radoičić, Géza Tóth
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p23
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)
Cites Work
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the number of points in general position in the plane
- 3-coloring arrangements of line segments with 4 slopes is hard
- A note on arrays of dots with distinct slopes
- General position subsets and independent hyperplanes in \(d\)-space
- Nonrepetitive colorings of line arrangements
- Colorings and doubled colorings of virtual doodles
This page was built for publication: A note on coloring line arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405217)