7 citations · 10 across the 6 of their papers we have counts for
6 papers
Binary Matroids with Graphic Cocircuits
Konstantinos Papalamprou, Leonidas Pitsoulis
An excluded minor characterization for the class of binary signed-graphic matroids with graphic cocircuits is provided. In this report we present the necessary computations for the…
-Sum Decomposition of Strongly Unimodular Matrices
Konstantinos Papalamprou, Leonidas Pitsoulis
Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroid…
Recognition algorithms for binary signed-graphic matroids
Leonidas Pitsoulis, Konstantinos Papalamprou
In this paper we provide two recognition algorithms for the class of signed-graphic matroids along with necessary and sufficient conditions for a matroid to be signed-graphic. Spec…
Decomposition of Binary Signed-Graphic Matroids
Konstantinos Papalamprou, Leonidas Pitsoulis
In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous…
Regular Matroids with Graphic Cocircuits
Konstantinos Papalamprou, Leonidas Pitsoulis
We introduce the notion of graphic cocircuits and show that a large class of regular matroids with graphic cocircuits belongs to the class of signed-graphic matroids. Moreover, we…
On the representability of totally unimodular matrices on bidirected graphs
L. Pitsoulis, K. Papalamprou, G. Appa +1
Seymour's famous decomposition theorem for regular matroids states that any totally unimodular (TU) matrix can be constructed through a series of composition operations called -…