The following pages link to Dirk Vertigan (Q234402):
Displaying 32 items.
- Large non-planar graphs and an application to crossing-critical graphs (Q631645) (← links)
- (Q871617) (redirect page) (← links)
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings (Q871618) (← links)
- Weak maps and stabilizers of classes of matroids (Q1271863) (← links)
- Partitioning graphs of bounded tree-width (Q1307308) (← links)
- A 2-isomorphism theorem for hypergraphs (Q1366606) (← links)
- Lê numbers of arrangements and matroid identities (Q1369655) (← links)
- Unavoidable minors of large 3-connected matroids (Q1386436) (← links)
- On maximum-sized near-regular and \(\root 6\of{1}\)-matroids (Q1393031) (← links)
- Partitioning into graphs with only small components (Q1405114) (← links)
- Bicycle dimension and special points of the Tutte polynomial (Q1569033) (← links)
- Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951) (← links)
- A short proof of non-GF(5)-representability of matroids (Q1826956) (← links)
- The complexity of computing the Tutte polynomial on transversal matroids (Q1842565) (← links)
- Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids (Q1850468) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
- On the excluded minors for quaternary matroids (Q1850484) (← links)
- Totally free expansions of matroids. (Q1850582) (← links)
- A new approach to solving three combinatorial enumeration problems on planar graphs (Q1894355) (← links)
- Planar electric networks. II (Q1911957) (← links)
- Unavoidable minors of large 3-connected binary matroids (Q1924132) (← links)
- On inequivalent representations of matroids over finite fields (Q1924152) (← links)
- Dowling geometries representable over rings (Q2343475) (← links)
- Unavoidable parallel minors of 4-connected graphs (Q3633013) (← links)
- (Q4273866) (← links)
- Recognizing Polymatroids Associated with Hypergraphs (Q4290102) (← links)
- The Computational Complexity of the Tutte Plane: the Bipartite Case (Q4291212) (← links)
- On the computational complexity of the Jones and Tutte polynomials (Q4712248) (← links)
- Latroids and their representation by codes over modules (Q4813829) (← links)
- Coloring-flow duality of embedded graphs (Q5461372) (← links)
- The Computational Complexity of Tutte Invariants for Planar Graphs (Q5470709) (← links)
- Infinite antichains of matroids with characteristic set \(\{ p\}\) (Q5957754) (← links)
