Isotropic matroids. II: Circle graphs
From MaRDI portal
Abstract: We present several characterizations of circle graphs, which follow from Bouchet's circle graph obstructions theorem.
Summary: We present several characterizations of circle graphs, which follow from Bouchet's circle graph obstructions theorem. For Part I see [the authors, ibid. 23, No. 4, Research Paper P4.1 (2016; Zbl 1351.05043)].
Recommendations
Cites work
- A characterization of circle graphs
- Binary matroids and local complementation
- Circle graph obstructions
- Cycle decomposition by disjoint transpositions
- Fast generation of regular graphs and construction of cages
- Graphes de cordes et espaces graphiques
- Graphic presentations of isotropic systems
- Graphs on surfaces. Dualities, polynomials, and knots
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3887722 (Why is no real title available?)
- scientific article; zbMATH DE number 4162893 (Why is no real title available?)
- 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 3230035 (Why is no real title available?)
- scientific article; zbMATH DE number 3257167 (Why is no real title available?)
- scientific article; zbMATH DE number 3361902 (Why is no real title available?)
- 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 systems
- Local complementation and interlacement graphs
- Multimatroids I. Coverings by Independent Sets
- Multimatroids. II: Orthogonality, minors and connectivity
- Multimatroids. III: Tightness and fundamental graphs
- Multimatroids. IV: Chain-group representations
- Nullity and loop complementation for delta-matroids
- On the linear algebra of local complementation
- Practical and efficient circle graph recognition
- Principal pivot transforms: Properties and applications
- Principally unimodular skew-symmetric matrices
- Recognition of Circle Graphs
- Reconnaissance des graphes de cordes
- Reducing prime graphs and recognizing circle graphs
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- Splitting cubic circle graphs
- The adjacency matroid of a graph
- The group structure of pivot and loop complementation on graphs and set systems
- The transition matroid of a 4-regular graph: an introduction
- Unimodularity and circle graphs
Cited in
(8)- The grid theorem for vertex-minors
- A characterization of circle graphs in terms of total unimodularity
- A characterization of circle graphs in terms of multimatroid representations
- Matroids, delta-matroids and embedded graphs
- Isotropic matroids. III: Connectivity
- Notes on a theorem of Naji
- Vertex-minors of graphs: a survey
- Isotropic matroids. I: Multimatroids and neighborhoods
This page was built for publication: Isotropic matroids. II: Circle graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727169)