Binary matroids and local complementation
From MaRDI portal
Abstract: We introduce a binary matroid M(IAS(G)) associated with a looped simple graph G. M(IAS(G)) classifies G up to local equivalence, and determines the delta-matroid and isotropic system associated with G. Moreover, a parametrized form of its Tutte polynomial yields the interlace polynomials of G.
Recommendations
Cites work
- scientific article; zbMATH DE number 3156382 (Why is no real title available?)
- scientific article; zbMATH DE number 4162893 (Why is no real title available?)
- scientific article; zbMATH DE number 67324 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3606473 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1445310 (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?)
- scientific article; zbMATH DE number 3361902 (Why is no real title available?)
- A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
- A Tutte Polynomial for Coloured Graphs
- A generalization of Tutte's characterization of totally unimodular matrices
- A multivariate interlace polynomial and its computation for graphs of bounded clique-width
- A two-variable interlace polynomial
- Approximate string-matching with q-grams and maximal matches
- Circle graph obstructions
- Cycle decomposition by disjoint transpositions
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Graph polynomials and their applications. I: The Tutte polynomial
- Graph polynomials derived from Tutte-Martin polynomials
- Graphic presentations of isotropic systems
- Greedy algorithm and symmetric matroids
- Interlace polynomials
- Interlace polynomials for multimatroids and delta-matroids
- Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices
- Isotropic systems
- Matroids. A geometric introduction
- Multimatroids I. Coverings by Independent Sets
- On the interlace polynomials
- Parametrized Tutte Polynomials of Graphs and Matroids
- Principal pivot transforms: Properties and applications
- Strong Tutte Functions of Matroids and Graphs
- Symmetric Representations of Binary Matroids
- The adjacency matroid of a graph
- The group structure of pivot and loop complementation on graphs and set systems
- The interlace polynomial of a graph
- The interlace polynomial of graphs at \(-1\)
- The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
- The transition matroid of a 4-regular graph: an introduction
- Theory of Matroids
- Tutte-Martin polynomials and orienting vectors of isotropic systems
- Weighted interlace polynomials
Cited in
(13)- The adjacency matroid of a graph
- On the linear algebra of local complementation
- The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
- A characterization of circle graphs in terms of multimatroid representations
- The excluded 3-minors for vf-safe delta-matroids
- Complementation, local complementation, and switching in binary matroids
- Isotropic matroids. II: Circle graphs
- The transition matroid of a 4-regular graph: an introduction
- Matroids that classify forests
- Isotropic matroids. I: Multimatroids and neighborhoods
- Matroids, delta-matroids and embedded graphs
- Orienting transversals and transition polynomials of multimatroids
- Isotropic matroids. III: Connectivity
This page was built for publication: Binary matroids and local complementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482118)
