Large Wk- or K3,t-Minors in 3-Connected Graphs (Q2811204): Difference between revisions

@@ Property / cites work @@
+Relative lengths of paths and cycles in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+A Decomposition for Combinatorial Geometries
@@ Property / cites work: A Decomposition for Combinatorial Geometries / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles in 3-connected graphs
@@ Property / cites work: Long cycles in 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The circumference of a graph with no \(K_{3,t}\)-minor. II
+Normal rank
@@ Property / cites work @@
+Capturing two elements in unavoidable minors of 3-connected binary matroids
+Normal rank
@@ Property / cites work @@
+Capturing matroid elements in unavoidable 3-connected minors
+Normal rank
@@ Property / cites work @@
+Unavoidable minors of large 3-connected binary matroids
+Normal rank
@@ Property / cites work @@
+Longest cycles in 3-connected cubic graphs
@@ Property / cites work: Longest cycles in 3-connected cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A sharp bound on the size of a connected matroid
@@ Property / cites work: A sharp bound on the size of a connected matroid / rank @@
+Normal rank
@@ Property / cites work @@
+Typical subgraphs of 3- and 4-connected graphs
@@ Property / cites work: Typical subgraphs of 3- and 4-connected graphs / rank @@
+Normal rank