Dirk L. Vertigan

According to our database, Dirk L. Vertigan authored at least 24 papers between 1991 and 2011.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2011

Large non-planar graphs and an application to crossing-critical graphs.

Guoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan

J. Comb. Theory B, 2011

2009

Unavoidable parallel minors of 4-connected graphs.

Carolyn Chun, Guoli Ding, Bogdan Oporowski, Dirk L. Vertigan

J. Graph Theory, 2009

2005

The Computational Complexity of Tutte Invariants for Planar Graphs.

Dirk L. Vertigan

SIAM J. Comput., 2005

2004

A short proof of non-GF(5)-representability of matroids.

James F. Geelen, James G. Oxley, Dirk Vertigan, Geoff Whittle

J. Comb. Theory B, 2004

Excluding any graph as a minor allows a low tree-width 2-coloring.

Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan

J. Comb. Theory B, 2004

2003

Partitioning into graphs with only small components.

Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan

J. Comb. Theory B, 2003

2002

Totally Free Expansions of Matroids.

James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle

J. Comb. Theory B, 2002

Infinite antichains of matroids with characteristic set {<i>p</i>}.

James G. Oxley, Charles Semple, Dirk L. Vertigan, Geoffrey P. Whittle

Discret. Math., 2002

2000

Generalized Delta?-Y Exchange and <i>k</i>-Regular Matroids.

James G. Oxley, Charles Semple, Dirk L. Vertigan

J. Comb. Theory B, 2000

On the Excluded Minors for Quaternary Matroids.

James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle

J. Comb. Theory B, 2000

Surfaces, Tree-Width, Clique-Minors, and Partitions.

Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan

J. Comb. Theory B, 2000

1998

Bicycle Dimension and Special Points of the Tutte Polynomial.

Dirk L. Vertigan

J. Comb. Theory B, 1998

On Maximum-Sized Near-Regular and ⁶Ö{1}-Matroids.

James G. Oxley, Dirk L. Vertigan, Geoff Whittle

Graphs Comb., 1998

Partitioning Graphs of Bounded Tree-Width.

Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan

Comb., 1998

1997

A 2-Isomorphism Theorem for Hypergraphs.

Dirk L. Vertigan, Geoffrey P. Whittle

J. Comb. Theory B, 1997

Lê Numbers of Arrangements and Matroid Identities.

David B. Massey, Rodica Simion, Richard P. Stanley, Dirk L. Vertigan, Dominic J. A. Welsh, Günter M. Ziegler

J. Comb. Theory B, 1997

Unavoidable Minors of Large 3-Connected Matroids.

Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan

J. Comb. Theory B, 1997

1996

On Inequivalent Representations of Matroids over Finite Fields.

James G. Oxley, Dirk L. Vertigan, Geoffrey P. Whittle

J. Comb. Theory B, 1996

Unavoidable Minors of Large 3-Connected Binary Matroids.

Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan

J. Comb. Theory B, 1996

1995

A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs.

Charles J. Colbourn, J. Scott Provan, Dirk Vertigan

Discret. Appl. Math., 1995

The Complexity of Computing the Tutte Polynomial on Transversal Matroids.

Charles J. Colbourn, J. Scott Provan, Dirk Vertigan

Comb., 1995

1993

Recognizing Polymatroids Associated with Hypergraphs.

Dirk Vertigan, Geoff Whittle

Comb. Probab. Comput., 1993

1992

The Compunational Complexity of the Tutte Plane: the Bipartite Case.

Dirk Vertigan, Dominic J. A. Welsh

Comb. Probab. Comput., 1992

1991

Minor classes (extended abstract).

Dirk Vertigan

Proceedings of the Graph Structure Theory, 1991