Graph Structure Theory
From MaRDI portal
Cited in
(4)- The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor.
- Amalgams of extremal matroids with no \(U_{2,\ell +2}\)-minor
- The Even-Path problem in directed single-crossing-minor-free graphs
- Parallel complexity of depth-first-search and maximal path in restricted graph classes
This page was built for publication: Graph Structure Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141905)