Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces (Q1410592): Difference between revisions

@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Petersen's Matching Theorem
+Normal rank
@@ Property / cites work @@
+Guarding polyhedral terrains
@@ Property / cites work: Guarding polyhedral terrains / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial theorem in plane geometry
@@ Property / cites work: A combinatorial theorem in plane geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Edge guarding polyhedral terrains
@@ Property / cites work: Edge guarding polyhedral terrains / rank @@
+Normal rank
@@ Property / cites work @@
+A short proof of Chvatal's Watchman Theorem
@@ Property / cites work: A short proof of Chvatal's Watchman Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4295776
@@ Property / cites work: Q4295776 / rank @@
+Normal rank
@@ Property / cites work @@
+The four-colour theorem
@@ Property / cites work: The four-colour theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945523
@@ Property / cites work: Q4945523 / rank @@
+Normal rank