default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDirk L. Vertigan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j23]Guoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan:
Large non-planar graphs and an application to crossing-critical graphs. J. Comb. Theory B 101(2): 111-121 (2011)
2000 – 2009
- 2009
- [j22]Carolyn Chun
, Guoli Ding, Bogdan Oporowski, Dirk L. Vertigan:
Unavoidable parallel minors of 4-connected graphs. J. Graph Theory 60(4): 313-326 (2009) - 2005
- [j21]Dirk L. Vertigan:
The Computational Complexity of Tutte Invariants for Planar Graphs. SIAM J. Comput. 35(3): 690-712 (2005) - 2004
- [j20]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 B 91(1): 25-41 (2004) - [j19]James F. Geelen, James G. Oxley, Dirk Vertigan, Geoff Whittle:
A short proof of non-GF(5)-representability of matroids. J. Comb. Theory B 91(1): 105-121 (2004) - 2003
- [j18]Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan:
Partitioning into graphs with only small components. J. Comb. Theory B 87(2): 231-243 (2003) - 2002
- [j17]James G. Oxley, Charles Semple, Dirk L. Vertigan, Geoffrey P. Whittle:
Infinite antichains of matroids with characteristic set {p}. Discret. Math. 242(1-3): 175-185 (2002) - [j16]James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle:
Totally Free Expansions of Matroids. J. Comb. Theory B 84(1): 130-179 (2002) - 2000
- [j15]James G. Oxley, Charles Semple, Dirk L. Vertigan:
Generalized Delta?-Y Exchange and k-Regular Matroids. J. Comb. Theory B 79(1): 1-65 (2000) - [j14]Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan:
Surfaces, Tree-Width, Clique-Minors, and Partitions. J. Comb. Theory B 79(2): 221-246 (2000) - [j13]James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle:
On the Excluded Minors for Quaternary Matroids. J. Comb. Theory B 80(1): 57-68 (2000)
1990 – 1999
- 1998
- [j12]Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan:
Partitioning Graphs of Bounded Tree-Width. Comb. 18(1): 1-12 (1998) - [j11]James G. Oxley, Dirk L. Vertigan, Geoff Whittle:
On Maximum-Sized Near-Regular and 6Ö{1}-Matroids. Graphs Comb. 14(2): 163-179 (1998) - [j10]Dirk L. Vertigan:
Bicycle Dimension and Special Points of the Tutte Polynomial. J. Comb. Theory B 74(2): 378-396 (1998) - 1997
- [j9]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 B 70(1): 118-133 (1997) - [j8]Dirk L. Vertigan, Geoffrey P. Whittle:
A 2-Isomorphism Theorem for Hypergraphs. J. Comb. Theory B 71(2): 215-230 (1997) - [j7]Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan:
Unavoidable Minors of Large 3-Connected Matroids. J. Comb. Theory B 71(2): 244-293 (1997) - 1996
- [j6]Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan:
Unavoidable Minors of Large 3-Connected Binary Matroids. J. Comb. Theory B 66(2): 334-360 (1996) - [j5]James G. Oxley, Dirk L. Vertigan, Geoffrey P. Whittle:
On Inequivalent Representations of Matroids over Finite Fields. J. Comb. Theory B 67(2): 325-343 (1996) - 1995
- [j4]Charles J. Colbourn, J. Scott Provan, Dirk Vertigan:
The Complexity of Computing the Tutte Polynomial on Transversal Matroids. Comb. 15(1): 1-10 (1995) - [j3]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): 119-129 (1995) - 1993
- [j2]Dirk Vertigan, Geoff Whittle:
Recognizing Polymatroids Associated with Hypergraphs. Comb. Probab. Comput. 2: 519-530 (1993) - 1992
- [j1]Dirk Vertigan, Dominic J. A. Welsh:
The Compunational Complexity of the Tutte Plane: the Bipartite Case. Comb. Probab. Comput. 1: 181-187 (1992) - 1991
- [c1]Dirk Vertigan:
Minor classes (extended abstract). Graph Structure Theory 1991: 495-509
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-24 21:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
