Abstract | ||
---|---|---|
We characterize all internally 4-connected binary matroids M with the property that the ground set of M can be ordered (e"0,...,e"n"-"1) in such a way that {e"i,...,e"i"+"t} is 4-separating for all [email protected]?i,[email protected]?n-1 (all subscripts are read modulo n). We prove that in this case either [email protected]?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 Mobius ladder, a particular single-element extension of a wheel, or a particular single-element extension of the bond matroid of a cubic ladder. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1016/j.disc.2009.08.001 | Discrete Mathematics |
Keywords | Field | DocType |
sequential ordering,cyclically sequential,4-connected,binary matroid | Matroid,Discrete mathematics,Polygon,Combinatorics,Modulo,Matroid partitioning,Isomorphism,Quartic function,Graphic matroid,Möbius ladder,Mathematics | Journal |
Volume | Issue | ISSN |
310 | 1 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.37 | 3 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jeremy Aikin | 1 | 9 | 1.48 |
Carolyn Chun | 2 | 25 | 8.25 |
Rhiannon Hall | 3 | 48 | 7.55 |
Dillon Mayhew | 4 | 102 | 18.63 |