The degree/diameter problem in maximal planar bipartite graphs (Q5965484): Difference between revisions

@@ Property / cites work @@
+Covering planar graphs with a fixed number of balls
+Normal rank
@@ Property / cites work @@
+Large planar graphs with given diameter and maximum degree
+Normal rank
@@ Property / cites work @@
+Q4448760
@@ Property / cites work: Q4448760 / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Two trees in maximal planar bipartite graphs
@@ Property / cites work: Two trees in maximal planar bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum size of a planar graph with given degree and even diameter
+Normal rank
@@ Property / cites work @@
+\(N\)-separators in planar graphs
@@ Property / cites work: \(N\)-separators in planar graphs / rank @@
+Normal rank