Isotropic systems
From MaRDI portal
Publication:1101116
DOI10.1016/S0195-6698(87)80027-6zbMath0642.05015OpenAlexW2914422925MaRDI QIDQ1101116
Publication date: 1987
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(87)80027-6
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (56)
A characterization of circle graphs in terms of total unimodularity ⋮ Isotropic matroids. III: Connectivity ⋮ Minimally 3-connected isotropic systems ⋮ Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs ⋮ On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12 ⋮ Vertex-minors, monadic second-order logic, and a conjecture by Seese ⋮ Transforming graph states using single-qubit operations ⋮ Graphic presentations of isotropic systems ⋮ Reducing prime graphs and recognizing circle graphs ⋮ Rank-width: algorithmic and structural results ⋮ Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions ⋮ Sorting by reversals and the theory of 4-regular graphs ⋮ The adjacency matroid of a graph ⋮ From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals ⋮ Recombination faults in gene assembly in ciliates modeled using multimatroids ⋮ Greedy algorithm and symmetric matroids ⋮ Counting single-qubit Clifford equivalent graph states is #P-complete ⋮ Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ Prime vertex-minors of a prime graph ⋮ Fast evaluation of interlace polynomials on graphs of bounded treewidth ⋮ Digraph Decompositions and Eulerian Systems ⋮ Transforming trees by successive local complementations ⋮ Interlace polynomials ⋮ Well-quasi-ordering of matrices under Schur complement and applications to directed graphs ⋮ Graphs of small rank-width are pivot-minors of graphs of small tree-width ⋮ Matroids that classify forests ⋮ Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation ⋮ Identities for circuit partition polynomials, with applications to the Tutte polynomial ⋮ Binary matroids and local complementation ⋮ Binary functions, degeneracy, and alternating dimaps ⋮ Tutte-Martin polynomials and orienting vectors of isotropic systems ⋮ An efficient algorithm to recognize locally equivalent graphs ⋮ The transition matroid of a 4-regular graph: an introduction ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ Orienting transversals and transition polynomials of multimatroids ⋮ Recognizing locally equivalent graphs ⋮ Distance Hereditary Graphs and the Interlace Polynomial ⋮ The interlace polynomial of a graph ⋮ Multimatroids. III: Tightness and fundamental graphs ⋮ The excluded 3-minors for vf-safe delta-matroids ⋮ Vertex-minors of graphs: a survey ⋮ Chi-boundedness of graph classes excluding wheel vertex-minors ⋮ Isotropic matroids. I: Multimatroids and neighborhoods ⋮ Isotropic matroids. II: Circle graphs ⋮ Scattered Classes of Graphs ⋮ Unavoidable vertex-minors in large prime graphs ⋮ A characterisation of graphs having three pariwise compatible Euler tours ⋮ Supplementary Eulerian vectors in isotropic systems ⋮ Exploring the Tutte-Martin connection ⋮ Rank-width and vertex-minors ⋮ Digraphs of Bounded Width ⋮ Graph polynomials derived from Tutte-Martin polynomials ⋮ Transition polynomials ⋮ Multimatroids. IV: Chain-group representations ⋮ Rank-width and Well-quasi-ordering of Skew-symmetric Matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance-hereditary graphs
- Graphic presentations of isotropic systems
- Reducing prime graphs and recognizing circle graphs
- On the evaluation at (3,3) of the Tutte polynomial of a graph
- Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
- Tutte-Martin polynomials and orienting vectors of isotropic systems
- Remarkable valuation of the dichromatic polynomial of planar multigraphs
- Le Polynôme De Martin D'un Graphe Eulerien
- Digraph Decompositions and Eulerian Systems
- Transforming trees by successive local complementations
- Decomposition of Directed Graphs
- On the Principal Edge Tripartition of a Graph
- Connectivity in Matroids
This page was built for publication: Isotropic systems
