Green's theorem and isolation in planar graphs (Q714498): Difference between revisions

← Older edit

@@ Property / DOI @@
-.1016/j.ic.2012.03.002
@@ Property / DOI: 10.1016/j.ic.2012.03.002 / rank @@
-Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Making Nondeterminism Unambiguous
@@ Property / cites work: Making Nondeterminism Unambiguous / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean complexity classes vs. their arithmetic analogs
+Normal rank
@@ Property / cites work @@
+Isolation, matching, and counting uniform and nonuniform upper bounds
+Normal rank
@@ Property / cites work @@
+Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
+Normal rank
@@ Property / cites work @@
+Directed Planar Reachability Is in Unambiguous Log-Space
+Normal rank
@@ Property / cites work @@
+Deterministically isolating a perfect matching in bipartite planar graphs
+Normal rank
@@ Property / cites work @@
+Q5786239
@@ Property / cites work: Q5786239 / rank @@
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar and grid graph reachability problems
@@ Property / cites work: Planar and grid graph reachability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+On Threshold Circuits and Polynomial Computation
@@ Property / cites work: On Threshold Circuits and Polynomial Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform constant-depth threshold circuits for division and iterated multiplication.
+Normal rank
@@ Property / DOI @@
+.1016/J.IC.2012.03.002
@@ Property / DOI: 10.1016/J.IC.2012.03.002 / rank @@
+Normal rank
@@ Property / Recommended article @@
+On the Power of Isolation in Planar Graphs
+Normal rank
+Similarity Score: 0.90067446Amount 0.90067446
Unit 1
-Amount
+.90067446
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
+Normal rank
+Similarity Score: 0.8773621Amount 0.8773621
Unit 1
-Amount
+.8773621
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Isolation of connected graphs
@@ Property / Recommended article: Isolation of connected graphs / rank @@
+Normal rank
@@ Property / Recommended article: Isolation of connected graphs / qualifier @@
+Similarity Score: 0.8658738Amount 0.8658738
Unit 1
-Amount
+.8658738
 Unit
@@ Property / Recommended article: Isolation of connected graphs / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Isolation number of maximal outerplanar graphs
+Normal rank
+Similarity Score: 0.86454594Amount 0.86454594
Unit 1
-Amount
+.86454594
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On greene's theorem for digraphs
@@ Property / Recommended article: On greene's theorem for digraphs / rank @@
+Normal rank
@@ Property / Recommended article: On greene's theorem for digraphs / qualifier @@
+Similarity Score: 0.86370593Amount 0.86370593
Unit 1
-Amount
+.86370593
 Unit
@@ Property / Recommended article: On greene's theorem for digraphs / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On the Path Separability of Planar Graphs
+Normal rank
+Similarity Score: 0.861149Amount 0.861149
Unit 1
-Amount
+.861149
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Isolation in graphs
@@ Property / Recommended article: Isolation in graphs / rank @@
+Normal rank
@@ Property / Recommended article: Isolation in graphs / qualifier @@
+Similarity Score: 0.86096483Amount 0.86096483
Unit 1
-Amount
+.86096483
 Unit
@@ Property / Recommended article: Isolation in graphs / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Farber's conjecture for planar graphs
@@ Property / Recommended article: Farber's conjecture for planar graphs / rank @@
+Normal rank
+Similarity Score: 0.8593036Amount 0.8593036
Unit 1
-Amount
+.8593036
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Combinatorial Green's function of a graph and applications to networks
+Normal rank
+Similarity Score: 0.859236Amount 0.859236
Unit 1
-Amount
+.859236
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+\( K_{1 , 2}\)-isolation in graphs
@@ Property / Recommended article: \( K_{1 , 2}\)-isolation in graphs / rank @@
+Normal rank
@@ Property / Recommended article: \( K_{1 , 2}\)-isolation in graphs / qualifier @@
+Similarity Score: 0.8587876Amount 0.8587876
Unit 1
-Amount
+.8587876
 Unit
@@ Property / Recommended article: \( K_{1 , 2}\)-isolation in graphs / qualifier @@
+Recommender Run: Recommender Run 2