Internally 4-connected binary matroids with cyclically sequential orderings

We 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

LIPIcs, Volume 274, ESA 2023, Complete Volume

LIPIcs, Volume 274, ESA 2023, Complete Volum

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)

The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..

LIPIcs, Volume 261, ICALP 2023, Complete Volume

LIPIcs, Volume 261, ICALP 2023, Complete Volum

LIPIcs, Volume 258, SoCG 2023, Complete Volume

LIPIcs, Volume 258, SoCG 2023, Complete Volum