Dirk Vertigan

Publication Activity (10 Years)

Years Active: 1991-2011
Publications (10 Years): 0

Publications

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