Sciweavers

9 search results - page 1 / 2
» Decompositions of signed-graphic matroids
Sort
View
SIAMDM
2011
12 years 11 months ago
An Obstacle to a Decomposition Theorem for Near-Regular Matroids
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, o...
Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwa...
DM
2007
100views more  DM 2007»
13 years 4 months ago
Decompositions of signed-graphic matroids
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decomposition theorem for signed graphs whose frame matroids are quaternary.
Daniel C. Slilaty, Hongxun Qin
JCT
2006
79views more  JCT 2006»
13 years 4 months ago
A characterization of cocircuit graphs of uniform oriented matroids
The cocircuit graph of an oriented matroid is the 1-skeleton of the cellular decomposition induced by the Topological Representation Theorem due to Folkman and Lawrence (1978) [J....
Juan José Montellano-Ballesteros, Ricardo S...
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
13 years 11 months ago
Finding Branch-Decompositions and Rank-Decompositions
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Petr Hlinený, Sang-il Oum
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 4 months ago
A Decomposition Theory for Binary Linear Codes
The decomposition theory of matroids initiated by Paul Seymour in the 1980's has had an enormous impact on research in matroid theory. This theory, when applied to matrices ov...
Navin Kashyap