Dirk Vertigan

13 papers Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
2011 J jnl
Large non-planar graphs and an application to crossing-critical graphs.
J. Comb. Theory B
Guoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan
2004 J jnl
A short proof of non-GF(5)-representability of matroids.
J. Comb. Theory B
James F. Geelen, James G. Oxley, Dirk Vertigan, Geoff Whittle
2004 J jnl
Excluding any graph as a minor allows a low tree-width 2-coloring.
J. Comb. Theory B
Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan
2003 J jnl
Partitioning into graphs with only small components.
J. Comb. Theory B
Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan
2002 J jnl
Totally Free Expansions of Matroids.
J. Comb. Theory B
James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle
2000 J jnl
On the Excluded Minors for Quaternary Matroids.
J. Comb. Theory B
James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle
1998 J jnl
Partitioning Graphs of Bounded Tree-Width.
Comb.
Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan
1996 J jnl
Unavoidable Minors of Large 3-Connected Binary Matroids.
J. Comb. Theory B
Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan
1995 J jnl
A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs.
Discret. Appl. Math.
Charles J. Colbourn, J. Scott Provan, Dirk Vertigan
1995 J jnl
The Complexity of Computing the Tutte Polynomial on Transversal Matroids.
Comb.
Charles J. Colbourn, J. Scott Provan, Dirk Vertigan
1993 J jnl
Recognizing Polymatroids Associated with Hypergraphs.
Comb. Probab. Comput.
Dirk Vertigan, Geoff Whittle
1992 J jnl
The Compunational Complexity of the Tutte Plane: the Bipartite Case.
Comb. Probab. Comput.
Dirk Vertigan, Dominic J. A. Welsh
1991 — conf
Minor classes (extended abstract).
Graph Structure Theory
Dirk Vertigan