The connectivity and minimum degree of circuit graphs of matroids (Q5962272): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10114-010-6685-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2152452333
@@ Property / OpenAlex ID: W2152452333 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths and cycles in matroid base graphs
@@ Property / cites work: Paths and cycles in matroid base graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound on connectivities of matroid base graphs
+Normal rank
@@ Property / cites work @@
+A Fan-In Algorithm for Distributed Sparse Numerical Factorization
+Normal rank
@@ Property / cites work @@
+The connectivity of the basis graph of a branching greedoid
+Normal rank
@@ Property / cites work @@
+Lower-bounds on the connectivities of a graph
@@ Property / cites work: Lower-bounds on the connectivities of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The connectivity of large digraphs and graphs
@@ Property / cites work: The connectivity of large digraphs and graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for equality of connectivity and minimum degree of a graph
+Normal rank
@@ Property / cites work @@
+Q4055660
@@ Property / cites work: Q4055660 / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal critically connected matroids
@@ Property / cites work: Extremal critically connected matroids / rank @@
+Normal rank