A Characterization of Circle Graphs in Terms of Total Unimodularity
Combinatorics
2021-10-07 v3
Abstract
A graph has an associated multimatroid , which is equivalent to the isotropic system of studied by Bouchet. In previous work it was shown that is a circle graph if and only if for every field , the rank function of can be extended to the rank function of an -representable matroid. In the present paper we strengthen this result using a multimatroid analogue of total unimodularity. As a consequence we obtain a characterization of matroid planarity in terms of this total-unimodularity analogue.
Keywords
Cite
@article{arxiv.1909.09038,
title = {A Characterization of Circle Graphs in Terms of Total Unimodularity},
author = {Robert Brijder and Lorenzo Traldi},
journal= {arXiv preprint arXiv:1909.09038},
year = {2021}
}
Comments
26 pages, 6 figures