Recognizing pinch-graphic matroids
From MaRDI portal
Recommendations
Cites work
- A chain theorem for 4-connected matroids
- A chain theorem for internally 4-connected binary matroids
- A Splitter Theorem for Internally 4‐Connected Binary Matroids
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- Decomposition of regular matroids
- Displaying blocking pairs in signed graphs
- Generating weakly 4-connected matroids
- scientific article; zbMATH DE number 3133252 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Matroids and Graphs
- On the notion of balance of a signed graph
- On Tutte's Characterization of Graphic Matroids
- Recognizing even-cycle and even-cut matroids
- Recognizing Even-Cycle and Even-Cut Matroids
Cited in
(2)
This page was built for publication: Recognizing pinch-graphic matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120838)