2010/11/30 by Leonidas Pitsoulis, Pitsoulis, Leonidas, Konstantinos Papalamprou +1
Computer Science · Mathematics · #52B40 #Advanced Graph Theory Research #Combinatorics (math.CO) #Digital Image Processing Techniques #FOS: Mathematics #Graph Labeling and Dimension Problems #math.CO #msc:52B40
paper · pdf · doi:10.48550/arxiv.1011.6504
This paper has been withdrawn by the authors due to a newly submitted version
openalex publication_date 2010/11/30 · arxiv created 2012/05/07 · arxiv updated 2012/05/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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. Specifically, we provide a polynomial-time algorithm which determines whether a given binary matroid is signed-graphic and an algorithm which determines whether a general matroid given by an independece oracle is binary signed-graphic.