Dirk L. Vertigan

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): 111-121 (2011)

Carolyn Chun, Guoli Ding, Bogdan Oporowski, Dirk L. Vertigan: Unavoidable parallel minors of 4-connected graphs. Journal of Graph Theory 60(4): 313-326 (2009)

Dirk L. Vertigan: The Computational Complexity of Tutte Invariants for Planar Graphs. SIAM J. Comput. 35(3): 690-712 (2005)

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): 25-41 (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): 105-121 (2004)

Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan: Partitioning into graphs with only small components. J. Comb. Theory, Ser. B 87(2): 231-243 (2003)

James G. Oxley, Charles Semple, Dirk L. Vertigan, Geoffrey P. Whittle: Infinite antichains of matroids with characteristic set {p}. Discrete Mathematics 242(1-3): 175-185 (2002)

James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle: Totally Free Expansions of Matroids. J. Comb. Theory, Ser. B 84(1): 130-179 (2002)

James G. Oxley, Charles Semple, Dirk L. Vertigan: Generalized Delta?-Y Exchange and k-Regular Matroids. J. Comb. Theory, Ser. B 79(1): 1-65 (2000)

Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan: Surfaces, Tree-Width, Clique-Minors, and Partitions. J. Comb. Theory, Ser. B 79(2): 221-246 (2000)

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): 57-68 (2000)

Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan: Partitioning Graphs of Bounded Tree-Width. Combinatorica 18(1): 1-12 (1998)

James G. Oxley, Dirk L. Vertigan, Geoff Whittle: On Maximum-Sized Near-Regular and ⁶Ö{1}-Matroids. Graphs and Combinatorics 14(2): 163-179 (1998)

Dirk L. Vertigan: Bicycle Dimension and Special Points of the Tutte Polynomial. J. Comb. Theory, Ser. B 74(2): 378-396 (1998)

David B. Massey, Rodica Simion, Richard P. Stanley, Dirk L. Vertigan, Dominic J. A. Welsh, Günter M. Ziegler: Lê Numbers of Arrangements and Matroid Identities. J. Comb. Theory, Ser. B 70(1): 118-133 (1997)

Dirk L. Vertigan, Geoffrey P. Whittle: A 2-Isomorphism Theorem for Hypergraphs. J. Comb. Theory, Ser. B 71(2): 215-230 (1997)

Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan: Unavoidable Minors of Large 3-Connected Matroids. J. Comb. Theory, Ser. B 71(2): 244-293 (1997)

Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan: Unavoidable Minors of Large 3-Connected Binary Matroids. J. Comb. Theory, Ser. B 66(2): 334-360 (1996)

James G. Oxley, Dirk L. Vertigan, Geoffrey P. Whittle: On Inequivalent Representations of Matroids over Finite Fields. J. Comb. Theory, Ser. B 67(2): 325-343 (1996)

Charles J. Colbourn, J. Scott Provan, Dirk Vertigan: The Complexity of Computing the Tutte Polynomial on Transversal Matroids. Combinatorica 15(1): 1-10 (1995)

Charles J. Colbourn, J. Scott Provan, Dirk Vertigan: A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs. Discrete Applied Mathematics 60(1-3): 119-129 (1995)

Dirk Vertigan, Geoff Whittle: Recognizing Polymatroids Associated with Hypergraphs. Combinatorics, Probability & Computing 2: 519-530 (1993)

Dirk Vertigan, Dominic J. A. Welsh: The Compunational Complexity of the Tutte Plane: the Bipartite Case. Combinatorics, Probability & Computing 1: 181-187 (1992)

Dirk Vertigan: Minor classes (extended abstract). Graph Structure Theory 1991: 495-510