default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDillon Mayhew
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j46]Dillon Mayhew
, Andrew Probert:
Supersolvable saturated matroids and chordal graphs. Adv. Appl. Math. 153: 102616 (2024)- [j45]Dillon Mayhew, Andrew Probert:
Reduced Clique Graphs: A Correction to "Chordal Graphs and Their Clique Graphs". Graphs Comb. 40(3): 58 (2024) - 2023
- [j44]Daryl Funk, Dillon Mayhew, Mike Newman:
Tree Automata and Pigeonhole Classes of Matroids: II. Electron. J. Comb. 30(3) (2023) - 2022
- [j43]Daryl Funk, Dillon Mayhew, Mike Newman:
Tree Automata and Pigeonhole Classes of Matroids: I. Algorithmica 84(7): 1795-1834 (2022) - 2021
- [j42]Dillon Mayhew, Mike Newman, Geoff Whittle:
Fractal classes of matroids. Adv. Appl. Math. 126: 101995 (2021) - [j41]Amanda Cameron, Dillon Mayhew:
Excluded minors for the class of split matroids. Australas. J Comb. 79: 195-204 (2021) - 2020
- [j40]Tara Fife, Dillon Mayhew, James G. Oxley, Charles Semple:
The Unbreakable Frame Matroids. SIAM J. Discret. Math. 34(3): 1522-1537 (2020) - 2019
- [j39]Dillon Mayhew, Irene Pivotto, Gordon F. Royle:
Structure of Cubic Lehman Matrices. Electron. J. Comb. 26(3): 3 (2019) - 2018
- [j38]Daryl Funk, Dillon Mayhew:
On excluded minors for classes of graphical matroids. Discret. Math. 341(6): 1509-1522 (2018) - [j37]Daryl Funk, Dillon Mayhew, Steven D. Noble:
How many delta-matroids are there? Eur. J. Comb. 69: 149-158 (2018) - 2017
- [j36]Carolyn Chun, Dillon Mayhew, James G. Oxley:
Towards a splitter theorem for internally 4-connected binary matroids VIII: Small matroids. Adv. Appl. Math. 85: 12-30 (2017) - [j35]Dillon Mayhew, Gordon F. Royle, Geoff Whittle:
Excluding Kuratowski graphs and their duals from binary matroids. J. Comb. Theory B 125: 95-113 (2017) - 2016
- [j34]Amanda Cameron, Dillon Mayhew:
Excluded Minors for Matroids Satisfying Kinser's Inequalities. Graphs Comb. 32(1): 31-47 (2016) - [j33]Carolyn Chun, Dillon Mayhew, James G. Oxley:
Towards a splitter theorem for internally 4-connected binary matroids IX: The theorem. J. Comb. Theory B 121: 2-67 (2016) - [j32]Ben Clark, Dillon Mayhew, Stefan H. M. van Zwam, Geoff Whittle:
The Structure of U2, 5, U3, 5-Fragile Matroids. SIAM J. Discret. Math. 30(3): 1480-1508 (2016) - [j31]Carolyn Chun, Guoli Ding, Dillon Mayhew, James G. Oxley:
Unavoidable Connected Matroids Retaining a Specified Minor. SIAM J. Discret. Math. 30(3): 1590-1606 (2016) - 2015
- [j30]Carolyn Chun, Deborah Chun, Dillon Mayhew, Stefan H. M. van Zwam:
Fan-Extensions in Fragile Matroids. Electron. J. Comb. 22(2): 2 (2015) - 2014
- [j29]Carolyn Chun, Dillon Mayhew, James G. Oxley:
Towards a splitter theorem for internally 4-connected binary matroids IV. Adv. Appl. Math. 52: 1-59 (2014) - [j28]Carolyn Chun, Dillon Mayhew, James G. Oxley:
Towards a splitter theorem for internally 4-connected binary matroids V. Adv. Appl. Math. 52: 60-81 (2014) - [j27]Carolyn Chun, Dillon Mayhew, James G. Oxley:
Towards a splitter theorem for internally 4-connected binary matroids II. Eur. J. Comb. 36: 550-563 (2014) - [j26]Joseph P. S. Kung, Dillon Mayhew, Irene Pivotto, Gordon F. Royle:
Maximum Size Binary Matroids with no AG(3, 2)-Minor are Graphic. SIAM J. Discret. Math. 28(3): 1559-1577 (2014) - 2013
- [j25]Dillon Mayhew, James G. Oxley, Charles Semple:
Special issue in honor of Geoff Whittle. Adv. Appl. Math. 50(1): 1-5 (2013) - [j24]Carolyn Chun, Dillon Mayhew, James G. Oxley:
Constructing internally 4-connected binary matroids. Adv. Appl. Math. 50(1): 16-45 (2013) - [j23]Dillon Mayhew, Dominic Welsh:
On the number of sparse paving matroids. Adv. Appl. Math. 50(1): 125-131 (2013) - [j22]Rhiannon Hall, Dillon Mayhew, Stefan H. M. van Zwam:
On the relative importance of excluded minors. Adv. Appl. Math. 50(1): 228-242 (2013) - [j21]Carolyn Chun, Dillon Mayhew, James G. Oxley:
Towards a splitter theorem for internally 4-connected binary matroids III. Adv. Appl. Math. 51(2): 309-344 (2013) - 2012
- [j20]Thomas Britz, Trygve Johnsen, Dillon Mayhew, Keisuke Shiromoto:
Wei-type duality theorems for matroids. Des. Codes Cryptogr. 62(3): 331-341 (2012) - [j19]Carolyn Chun, Dillon Mayhew, James G. Oxley:
Towards a splitter theorem for internally 4-connected binary matroids. J. Comb. Theory B 102(3): 688-700 (2012) - [j18]Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam:
Stability, fragility, and Rotaʼs Conjecture. J. Comb. Theory B 102(3): 760-783 (2012) - [j17]Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam:
The structure of graphs with a vital linkage of order 2. J. Graph Theory 71(2): 176-181 (2012) - [j16]Dillon Mayhew, Gordon F. Royle:
The Internally 4-Connected Binary Matroids with No $M(K_{5}\backslash e)$-Minor. SIAM J. Discret. Math. 26(2): 755-767 (2012) - 2011
- [j15]Rhiannon Hall, Dillon Mayhew, Stefan H. M. van Zwam:
The excluded minors for near-regular matroids. Eur. J. Comb. 32(6): 802-830 (2011) - [j14]Dillon Mayhew, Mike Newman, Dominic Welsh, Geoff Whittle:
On the asymptotic proportion of connected matroids. Eur. J. Comb. 32(6): 882-890 (2011) - [j13]Dillon Mayhew, Bogdan Oporowski, James G. Oxley, Geoff Whittle:
The excluded minors for the class of matroids that are binary or ternary. Eur. J. Comb. 32(6): 891-930 (2011) - [j12]Carolyn Chun, Dillon Mayhew, James G. Oxley:
A chain theorem for internally 4-connected binary matroids. J. Comb. Theory B 101(3): 141-189 (2011) - [j11]Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam:
An Obstacle to a Decomposition Theorem for Near-Regular Matroids. SIAM J. Discret. Math. 25(1): 271-279 (2011) - 2010
- [j10]Jeremy Aikin, Carolyn Chun, Rhiannon Hall, Dillon Mayhew:
Internally 4-connected binary matroids with cyclically sequential orderings. Discret. Math. 310(1): 92-108 (2010) - 2009
- [j9]Dillon Mayhew, Mike Newman, Geoff Whittle:
On excluded minors for real-representability. J. Comb. Theory B 99(4): 685-689 (2009) - 2008
- [j8]Rhiannon Hall, Dillon Mayhew:
Contracting an element from a cocircuit. Adv. Appl. Math. 41(4): 510-529 (2008) - [j7]Dillon Mayhew, Gordon F. Royle:
Matroids with nine elements. J. Comb. Theory B 98(2): 415-431 (2008) - [j6]Dillon Mayhew:
Matroid Complexity and Nonsuccinct Descriptions. SIAM J. Discret. Math. 22(2): 455-466 (2008) - 2006
- [j5]Dillon Mayhew:
Equitable Matroids. Electron. J. Comb. 13(1) (2006) - [j4]Dillon Mayhew:
Circuits and Cocircuits in Regular Matroids. Graphs Comb. 22(3): 383-389 (2006) - 2005
- [j3]Dillon Mayhew:
Families of matroids induced by classes of graphs. Adv. Appl. Math. 34(3): 616-633 (2005) - [j2]Dillon Mayhew:
Inequivalent Representations of Bias Matroids. Comb. Probab. Comput. 14(4): 567-583 (2005) - 2004
- [j1]James F. Geelen, Dillon Mayhew, Geoff Whittle:
Inequivalent representations of matroids having no U3, 6-minor. J. Comb. Theory B 92(1): 55-67 (2004)
Informal and Other Publications
- 2024
- [i2]Graham Farr, Dillon Mayhew, James G. Oxley:
Dominic Welsh: his work and influence. CoRR abs/2407.18974 (2024) - 2009
- [i1]Thomas Britz, Bård Heiseldel, Trygve Johnsen, Dillon Mayhew, Keisuke Shiromoto:
Generalizations of Wei's Duality Theorem. CoRR abs/0910.2099 (2009)
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-08-25 20:07 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:
