Unavoidable minors of large 4-connected bicircular matroids (Q2343466): Difference between revisions

@@ Property / author @@
-Daniel C. Slilaty
@@ Property / author: Daniel C. Slilaty / rank @@
-Normal rank
@@ Property / author @@
+Daniel C. Slilaty
@@ Property / author: Daniel C. Slilaty / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2059669064
@@ Property / OpenAlex ID: W2059669064 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds on maximal and maximum matchings
@@ Property / cites work: Tight bounds on maximal and maximum matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Unavoidable minors of large 3-connected matroids
@@ Property / cites work: Unavoidable minors of large 3-connected matroids / rank @@
+Normal rank
@@ Property / cites work @@
+BICIRCULAR MATROIDS
@@ Property / cites work: BICIRCULAR MATROIDS / 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
@@ Property / cites work @@
+Q5390304
@@ Property / cites work: Q5390304 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity in frame matroids
@@ Property / cites work: Connectivity in frame matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity in bicircular matroids
@@ Property / cites work: Connectivity in bicircular matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Biased graphs. II: The three matroids
@@ Property / cites work: Biased graphs. II: The three matroids / rank @@
+Normal rank