Nonseparating Cocircuits in Binary Matroids
From MaRDI portal
Publication:5020847
DOI10.1137/21M139339XzbMATH Open1486.05039OpenAlexW4205769087MaRDI QIDQ5020847FDOQ5020847
Authors: Donald K. Wagner 
Publication date: 7 January 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m139339x
Recommendations
- Non-separating cocircuits in binary matroids
- Non-separating cocircuits in matroids
- scientific article
- A characterization of graphic matroids using non-separating cocircuits
- Intersections of circuits and cocircuits in binary matroids
- Circuit and cocircuit partitions of binary matroids
- scientific article; zbMATH DE number 5572988
- Short cocircuits in binary matroids
- Circuits and cocircuits in regular matroids
- On the intersections of circuits and cocircuits in matroids
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- A characterization of graphic matroids using non-separating cocircuits
- Characterizing 3-connected planar graphs and graphic matroids
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- Title not available (Why is that?)
- Characterizing graphic matroids by a system of linear equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lectures on matroids
- On even matroids
- A new characterization of graphic matroids
- A Combinatorial Decomposition Theory
- Dividing a Graph into Triconnected Components
- How to Draw a Graph
- 2-Isomorphic Graphs
- A simple theorem on 3-connectivity
- Connectivity in Matroids
- Stabilizers of classes of representable matroids
- Converting Linear Programs to Network Problems
- On the structure of 3-connected matroids and graphs
- A splitter theorem relative to a fixed basis
- Maintaining 3-connectivity relative to a fixed basis
- An efficient PQ-graph algorithm for solving the graph-realization problem
- An Almost Linear-Time Algorithm for Graph Realization
- On Mighton's characterization of graphic matroids
- A note on detecting simple redundancies in linear systems
- Title not available (Why is that?)
- Non-separating cocircuits in matroids
- Non-separating cocircuits in binary matroids
- Title not available (Why is that?)
- Separating cocircuits in binary matroids
- Concept of a vertex in a matroid and 3-connected graphs
- From Matrices to Graphs
- Title not available (Why is that?)
- Connected hyperplanes in binary matroids
- Connected hyperplanes in binary matroids
- Cocircuit coverings and packings for binary matroids
- Matroid 3-connectivity and branch width
- Non-separating cocircuits avoiding some elements
- Solution to the realizability problem for irredundant Boolean branch- networks
Cited In (9)
- Short cocircuits in binary matroids
- Obstructions to a binary matroid being graphic
- Large circuits in binary matroids of large cogirth. II
- Non-separating cocircuits avoiding some elements
- Non-splitting flags, iterated circuits, \(\underline{\sigma}\)-matrices and Cayley configurations
- A characterization of graphic matroids using non-separating cocircuits
- On the intersections of circuits and cocircuits in matroids
- Circuit and cocircuit partitions of binary matroids
- Non-separating cocircuits in binary matroids
This page was built for publication: Nonseparating Cocircuits in Binary Matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020847)
