A characterization of circle graphs in terms of multimatroid representations
From MaRDI portal
Publication:2290352
Abstract: The isotropic matroid of a looped simple graph is a binary matroid equivalent to the isotropic system of . In general, is not regular, so it cannot be represented over fields of characteristic . The ground set of is denoted ; it is partitioned into 3-element subsets corresponding to the vertices of . When the rank function of is restricted to subtransversals of this partition, the resulting structure is a multimatroid denoted . In this paper we prove that is a circle graph if and only if for every field , there is an -representable matroid with ground set , which defines by restriction. We connect this characterization with several other circle graph characterizations that have appeared in the literature.
Recommendations
Cites work
- scientific article; zbMATH DE number 3606473 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 3257167 (Why is no real title available?)
- A characterization of circle graphs
- A proof of a circle graph characterization
- An alternative formula for the number of Euler trails for a class of digraphs
- Binary matroids and local complementation
- Circle graph obstructions
- Interlace polynomials for multimatroids and delta-matroids
- Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices
- Isotropic matroids. I: Multimatroids and neighborhoods
- Isotropic matroids. II: Circle graphs
- Isotropic matroids. III: Connectivity
- Multimatroids I. Coverings by Independent Sets
- Multimatroids. II: Orthogonality, minors and connectivity
- Multimatroids. III: Tightness and fundamental graphs
- Multimatroids. IV: Chain-group representations
- Naji's characterization of circle graphs
- Notes on a theorem of Naji
- On a formula for the number of Euler trails for a class of digraphs
- On the number of Euler trails in directed graphs
- Orienting transversals and transition polynomials of multimatroids
- Practical and efficient circle graph recognition
- Recognition of Circle Graphs
- Reconnaissance des graphes de cordes
- The transition matroid of a 4-regular graph: an introduction
- Unimodularity and circle graphs
Cited in
(7)- A characterization of circle graphs in terms of total unimodularity
- 2-nested matrices: towards understanding the structure of circle graphs
- A circle criterion for a generalized cross graph in terms of minimal excluded minors
- Naji's characterization of circle graphs
- Isotropic matroids. I: Multimatroids and neighborhoods
- Isotropic matroids. II: Circle graphs
- scientific article; zbMATH DE number 2211935 (Why is no real title available?)
This page was built for publication: A characterization of circle graphs in terms of multimatroid representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290352)