On the connectivity of visibility graphs (Q715001): Difference between revisions

@@ Property / arXiv ID @@
+.3622
@@ Property / arXiv ID: 1106.3622 / rank @@
+Normal rank
@@ Property / cites work @@
+Every large point set contains many collinear points or an empty pentagon
+Normal rank
@@ Property / cites work @@
+Degree sequence conditions for maximally edge-connected graphs depending on the clique number
+Normal rank
@@ Property / cites work @@
+Q5881918
@@ Property / cites work: Q5881918 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5692715
@@ Property / cites work: Q5692715 / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic number of the visibility graph of a set of points in the plane
+Normal rank
@@ Property / cites work @@
+Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
+Normal rank
@@ Property / cites work @@
+Blocking visibility for points in general position
+Normal rank
@@ Property / cites work @@
+On the connectivity of visibility graphs
@@ Property / cites work: On the connectivity of visibility graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Visibility graphs of point sets in the plane
@@ Property / cites work: Visibility graphs of point sets in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079637
@@ Property / cites work: Q4079637 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3356329
@@ Property / cites work: Q3356329 / rank @@
+Normal rank
@@ Property / cites work @@
+On visibility and blockers
@@ Property / cites work: On visibility and blockers / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Numbers and Hard Erdős Problems in Discrete Geometry
+Normal rank
@@ Property / cites work @@
+Degree sequence conditions for equal edge‐connectivity and minimum degree, depending on the clique number
+Normal rank