Note on inseparability graphs of matroids having exactly one class of orientations
From MaRDI portal
The oriented matroids whose inseparability graph is complete are identified as the oriented matroids of series-parallel graphs. Furthermore, the signed inseparability graph of such an oriented matroid, which records which pairs of elements are covariant resp.\ contravariant, determines the network. Reviewer's remark: The two conjectures at the end of the paper are false on the extension of \(R_{10}\) with a parallel element, whose inseparability graph has only one edge.
Recommendations
Cites work
- A Combinatorial Model for Series-Parallel Networks
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Decomposition of regular matroids
- scientific article; zbMATH DE number 4016785 (Why is no real title available?)
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 53152 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3227800 (Why is no real title available?)
- Inseparability graphs of oriented matroids
- On sign-invariance graphs of uniform oriented matroids
- Orientability of matroids
- Reconstruction of the orientation class of an oriented matroid
- Theory of Matroids
- Topology of series-parallel networks
Cited in
(3)
This page was built for publication: Note on inseparability graphs of matroids having exactly one class of orientations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363689)