Recommendations
Cites work
- A bidirected generalization of network matrices
- A short proof of Tutte's characterization of totally unimodular matrices
- A simple algorithm that proves half‐integrality of bidirected network programming
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- An Almost Linear-Time Algorithm for Graph Realization
- Converting Linear Programs to Network Problems
- Decomposition of regular matroids
- Disjoint homotopic paths and trees in a planar graph
- Graphs and Vector Spaces
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3133252 (Why is no real title available?)
- scientific article; zbMATH DE number 3276429 (Why is no real title available?)
- Kuratowski's and Wagner's theorems for matroids
- Lectures on matroids
- Matrices with the Edmonds-Johnson property
- Maximum matching and a polyhedron with 0,1-vertices
- Modules unimodulaires
- New polynomial-time algorithms for Camion bases
- On even matroids
- On the complexity of testing for odd holes and induced odd paths
- Orientation of matrices
- Orientation of signed graphs
- Recent work in matroid representation theory
- Signed graphs
- Simplicial cells in arrangements of hyperplanes
Cited in
(5)
This page was built for publication: Recognizing binet matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638382)