Inapproximability results related to monophonic convexity (Q499364): Difference between revisions

@@ Property / cites work @@
+Q5419955
@@ Property / cites work: Q5419955 / rank @@
+Normal rank
@@ Property / cites work @@
+On slowly percolating sets of minimal size in bootstrap percolation
+Normal rank
@@ Property / cites work @@
+Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
+Normal rank
@@ Property / cites work @@
+An introduction to clique minimal separator decomposition
+Normal rank
@@ Property / cites work @@
+Q4780500
@@ Property / cites work: Q4780500 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results related to monophonic convexity
+Normal rank
@@ Property / cites work @@
+Convex sets in graphs. II: Minimal path convexity
@@ Property / cites work: Convex sets in graphs. II: Minimal path convexity / rank @@
+Normal rank
@@ Property / cites work @@
+Convexity in graphs
@@ Property / cites work: Convexity in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal decomposition by clique separators
@@ Property / cites work: Optimal decomposition by clique separators / rank @@
+Normal rank
@@ Property / cites work @@
+Euclidean Distance Geometry and Applications
@@ Property / cites work: Euclidean Distance Geometry and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
+Normal rank
@@ Property / cites work @@
+On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
+Normal rank
@@ Property / cites work @@
+The connected monophonic number of a graph
@@ Property / cites work: The connected monophonic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank