On arrangements of orthogonal circles
From MaRDI portal
Publication:2206852
DOI10.1007/978-3-030-35802-0_17OpenAlexW2990994733MaRDI QIDQ2206852
Alexander Wolff, Henry Förster, Myroslav Kryven, Steven Chaplick
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1907.08121
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
Necessary and sufficient conditions for orthogonal circles ⋮ Arrangements of orthogonal circles with many intersections ⋮ Arrangements of orthogonal circles with many intersections
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sphere and dot product representations of graphs
- Minimum clique partition in unit disk graphs
- Large cliques in \(C_4\)-free graphs
- Arrangements of pseudocircles and circles
- Unit disk graphs
- The logic engine and the realization problem for nearest neighbor graphs
- Unit disk graph recognition is NP-hard
- Discrete and computational geometry. The Goodman-Pollack Festschrift
- Gallai-Sylvester theorem for pairwise intersecting unit circles
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
- Arrangements of Lines with a Large Number of Triangles
- Arrangements of Pseudocircles: Triangles and Drawings
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
- Representing graphs by disks and balls (a survey of recognition-complexity results)
- On the complexity of arrangements of circles in the plane
This page was built for publication: On arrangements of orthogonal circles