Decomposition of Quaternary Signed-Graphic Matroids
Leonidas Pitsoulis, Eleni-Maria Vretta
TL;DR
This paper presents a decomposition theorem for quaternary signed-graphic matroids, extending previous binary results and laying the groundwork for a recognition algorithm in this class.
Contribution
It generalizes existing decomposition theorems from binary to quaternary signed-graphic matroids, enabling new recognition methods.
Findings
Decomposition theorem for quaternary signed-graphic matroids
Extension of binary signed-graphic matroid results
Foundation for a recognition algorithm
Abstract
In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical basis for a recognition algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Digital Image Processing Techniques