A Characterization of Circle Graphs in Terms of Multimatroid Representations

Electronic Journal of Combinatorics, 2020.

Cited by: 0|Bibtex|Views7|Links
EI

Abstract:

The isotropic matroid $M[IAS(G)]$ of a looped simple graph $G$ is a binary matroid equivalent to the isotropic system of $G$. In general, $M[IAS(G)]$ is not regular, so it cannot be represented over fields of characteristic $\neq 2$. The ground set of $M[IAS(G)]$ is denoted $W(G)$; it is partitioned into 3-element subsets corresponding ...More

Code:

Data:

Your rating :
0

 

Tags
Comments