Recognizing even-cycle and even-cut matroids
From MaRDI portal
(Redirected from Publication:6052071)
Recommendations
Cites work
- 2-Isomorphic Graphs
- A Splitter Theorem for Internally 4‐Connected Binary Matroids
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- Biased graphs. II: The three matroids
- Combinatorial optimization. Networks and matroids
- Connectivity in Matroids
- Decomposition of regular matroids
- Discrete optimization I. Proceedings of the Advanced Research Institute on discrete optimization and systems applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium, co-sponsored by IBM Canada and SIAM, Banff, Alta, an
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Lectures on matroids
- Matroids and Graphs
- On the minor-minimal 3-connected matroids having a fixed minor.
- On the notion of balance of a signed graph
- On Tutt's Characterization of graphic matroids—a graphic proof
- On Tutte's Characterization of Graphic Matroids
- Recognizing Even-Cycle and Even-Cut Matroids
- Recognizing graphic matroids
- Recognizing pinch-graphic matroids
- Small separations in pinch-graphic matroids
- Stabilizer theorems for even cycle matroids
- Towards a matroid-minor structure theory
Cited in
(4)
This page was built for publication: Recognizing even-cycle and even-cut matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6052071)