The key to Seymour’s Regular Matroid DecompositionTheorem is his result that each 3-connected regular matroid with no R 10 -or R 12 -minor is graphic or cographic. We present a proof of this in terms ofsigned graphs
The key to Seymour’s Regular Matroid DecompositionTheorem is his result that each 3-connected regular matroid with no R 10 -or R 12 -minor is graphic or cographic. We present a proof of this in terms ofsigned graphs
|
|