scientific article; zbMATH DE number 1303530
From MaRDI portal
Publication:4250152
Recommendations
Cited in
(18)- On extremal connectivity properties of unavoidable matroids
- Unavoidable minors of large 3-connected matroids
- Unavoidable minors of graphs of large type
- On graphic matroid minors that guarantee their duals as minors
- Unavoidable minors of large 3-connected binary matroids
- Capturing two elements in unavoidable minors of 3-connected binary matroids
- Unavoidable minors for graphs with large \(\ell_p\)-dimension
- Unavoidable parallel minors of regular matroids
- Unavoidable minors for connected 2-polymatroids
- Unavoidable minors of large 4-connected bicircular matroids
- A sharp bound on the size of a connected matroid
- Unavoidable connected matroids retaining a specified minor
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
- Capturing matroid elements in unavoidable 3-connected minors
- A note on minors of uncountable graphs
- Forcing unbalanced complete bipartite minors
- Unavoidable vertex-minors in large prime graphs
- Detecting minors in matroids through triangles
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250152)