Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/3653
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAikin, J-
dc.contributor.authorChun, C-
dc.contributor.authorHall, R-
dc.contributor.authorMayhew, D-
dc.coverage.spatial17en
dc.date.accessioned2009-09-25T09:57:56Z-
dc.date.available2009-09-25T09:57:56Z-
dc.date.issued2010-
dc.identifier.citationDiscrete Mathematics. 310(1): 92-108, Jan 2010en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/3653-
dc.identifier.urihttp://www.sciencedirect.com/science/article/pii/S0012365X09003999en
dc.description.abstractWe characterize all internally 4-connected binary matroids M with the property that the ground set of M can be ordered (e0,…,en−1) in such a way that {ei,…,ei+t} is 4-separating for all 0≤i,t≤n−1 (all subscripts are read modulo n). We prove that in this case either n≤7 or, up to duality, M is isomorphic to the polygon matroid of a cubic or quartic planar ladder, the polygon matroid of a cubic or quartic Möbius ladder, a particular single-element extension of a wheel, or a particular single-element extension of the bond matroid of a cubic ladder.en
dc.format.extent299056 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherElsevieren
dc.subjectCyclically sequentialen
dc.subject4-Connecteden
dc.subjectBinary matroiden
dc.subjectSequential orderingen
dc.titleInternally 4-connected binary matroids with cyclically sequential orderingsen
dc.typeResearch Paperen
dc.identifier.doihttp://dx.doi.org/10.1016/j.disc.2009.08.001-
Appears in Collections:Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
Internally 4-connected binary matroids with cyclically sequential orderings.pdf292.05 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.