Dirk Vertigan

Available identifiers

zbMath Open vertigan.dirkMaRDI QIDQ234402

List of research outcomes

Publication	Date of Publication	Type
Dowling geometries representable over rings	2015-05-05	Paper
Large non-planar graphs and an application to crossing-critical graphs	2011-03-14	Paper
Unavoidable parallel minors of 4-connected graphs	2009-06-16	Paper
An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings	2007-03-20	Paper
The Computational Complexity of Tutte Invariants for Planar Graphs	2006-06-01	Paper
Coloring-flow duality of embedded graphs	2005-07-26	Paper
Latroids and their representation by codes over modules	2004-08-13	Paper
Excluding any graph as a minor allows a low tree-width 2-coloring	2004-08-06	Paper
A short proof of non-GF(5)-representability of matroids	2004-08-06	Paper
Partitioning into graphs with only small components	2003-08-25	Paper
Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids	2002-12-10	Paper
Surfaces, tree-width, clique-minors, and partitions	2002-12-10	Paper
On the excluded minors for quaternary matroids	2002-12-10	Paper
Totally free expansions of matroids.	2002-12-10	Paper
Infinite antichains of matroids with characteristic set \(\{ p\}\)	2002-08-24	Paper
Bicycle dimension and special points of the Tutte polynomial	2000-06-25	Paper
Partitioning graphs of bounded tree-width	1999-10-31	Paper
On maximum-sized near-regular and \(\root 6\of{1}\)-matroids	1999-06-23	Paper
Weak maps and stabilizers of classes of matroids	1999-04-06	Paper
Unavoidable minors of large 3-connected matroids	1998-10-05	Paper
Lê numbers of arrangements and matroid identities	1997-11-25	Paper
A 2-isomorphism theorem for hypergraphs	1997-09-15	Paper
On inequivalent representations of matroids over finite fields	1997-02-17	Paper
Planar electric networks. II	1996-12-03	Paper
Unavoidable minors of large 3-connected binary matroids	1996-11-25	Paper
A new approach to solving three combinatorial enumeration problems on planar graphs	1996-03-11	Paper
The complexity of computing the Tutte polynomial on transversal matroids	1995-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q4273866	1994-05-30	Paper
The Computational Complexity of the Tutte Plane: the Bipartite Case	1994-05-05	Paper
Recognizing Polymatroids Associated with Hypergraphs	1994-04-28	Paper
On the computational complexity of the Jones and Tutte polynomials	1992-06-25	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Dirk Vertigan