Graphic presentations of isotropic systems

DOI10.1016/0095-8956(88)90055-XzbMath0662.05014OpenAlexW1964589141MaRDI QIDQ1113912

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90055-x

zbMATH Keywords

representation simple graphs fundamental graphs isotropic systems

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

A characterization of circle graphs in terms of total unimodularity, Intertwining Connectivities for Vertex-Minors and Pivot-Minors, Isotropic matroids. III: Connectivity, Minimally 3-connected isotropic systems, A BRACKET POLYNOMIAL FOR GRAPHS, IV: UNDIRECTED EULER CIRCUITS, GRAPH-LINKS AND MULTIPLY MARKED GRAPHS, Isotropic systems, Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs, Notes on a theorem of Naji, 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, Reducing prime graphs and recognizing circle graphs, Rank-width: algorithmic and structural results, Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions, The selfnegadual properties of generalized quadratic Boolean functions, From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals, A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors, Greedy algorithm and symmetric matroids, Counting single-qubit Clifford equivalent graph states is #P-complete, Treewidth, Circle Graphs, and Circular Drawings, Directed graph representation of half-rate additive codes over \(\text{GF}(4)\), Prime vertex-minors of a prime graph, Nullity invariance for pivot and the interlace polynomial, Fast evaluation of interlace polynomials on graphs of bounded treewidth, Digraph Decompositions and Eulerian Systems, Interlace polynomials, Matroids that classify forests, The group structure of pivot and loop complementation on graphs and set systems, Edge local complementation for logical cluster states, Practical and efficient circle graph recognition, The average cut-rank of graphs, Binary matroids and local complementation, 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, Exclusivity structures and graph representatives of local complementation orbits, Recognizing locally equivalent graphs, Interlace polynomials: enumeration, unimodality and connections to codes, On graphs and codes preserved by edge local complementation, Distance Hereditary Graphs and the Interlace Polynomial, The interlace polynomial of a graph, Multimatroids. III: Tightness and fundamental graphs, Aperiodic propagation criteria for Boolean functions, The excluded 3-minors for vf-safe delta-matroids, Chi-boundedness of graph classes excluding wheel vertex-minors, Isotropic matroids. I: Multimatroids and neighborhoods, Isotropic matroids. II: Circle graphs, Unavoidable vertex-minors in large prime graphs, Excluded vertex-minors for graphs of linear rank-width at most \(k\), From graph states to two-graph states, Edge local complementation and equivalence of binary linear codes, A characterisation of graphs having three pariwise compatible Euler tours, Supplementary Eulerian vectors in isotropic systems, Circle graph obstructions under pivoting, Bipartite graphs that are not circle graphs, Digraphs of Bounded Width, Graph polynomials derived from Tutte-Martin polynomials, Multimatroids. IV: Chain-group representations, Formal systems for gene assembly in ciliates., The grid theorem for vertex-minors

Cites Work