Pages that link to "Item:Q1113912"
From MaRDI portal
The following pages link to Graphic presentations of isotropic systems (Q1113912):
Displaying 50 items.
- Notes on a theorem of Naji (Q329556) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Binary matroids and local complementation (Q482118) (← links)
- The transition matroid of a 4-regular graph: an introduction (Q491757) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- The group structure of pivot and loop complementation on graphs and set systems (Q648991) (← links)
- Recognizing locally equivalent graphs (Q685658) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Isotropic matroids. I: Multimatroids and neighborhoods (Q727168) (← links)
- Isotropic matroids. II: Circle graphs (Q727169) (← links)
- Unavoidable vertex-minors in large prime graphs (Q740266) (← links)
- Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12 (Q855831) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Interlace polynomials: enumeration, unimodality and connections to codes (Q968188) (← links)
- From graph states to two-graph states (Q1009039) (← links)
- Edge local complementation and equivalence of binary linear codes (Q1009082) (← links)
- Isotropic systems (Q1101116) (← links)
- Reducing prime graphs and recognizing circle graphs (Q1116953) (← links)
- Tutte-Martin polynomials and orienting vectors of isotropic systems (Q1180433) (← links)
- An efficient algorithm to recognize locally equivalent graphs (Q1181011) (← links)
- A characterisation of graphs having three pariwise compatible Euler tours (Q1264154) (← links)
- Supplementary Eulerian vectors in isotropic systems (Q1264155) (← links)
- Bipartite graphs that are not circle graphs (Q1296144) (← links)
- Multimatroids. IV: Chain-group representations (Q1307539) (← links)
- Minimally 3-connected isotropic systems (Q1340133) (← links)
- Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs (Q1356405) (← links)
- Interlace polynomials (Q1418963) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Formal systems for gene assembly in ciliates. (Q1853740) (← links)
- The selfnegadual properties of generalized quadratic Boolean functions (Q1934225) (← links)
- The excluded 3-minors for vf-safe delta-matroids (Q2020023) (← links)
- The grid theorem for vertex-minors (Q2099410) (← links)
- A characterization of circle graphs in terms of total unimodularity (Q2122669) (← links)
- The average cut-rank of graphs (Q2225395) (← links)
- On graphs and codes preserved by edge local complementation (Q2260792) (← links)
- Isotropic matroids. III: Connectivity (Q2363112) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Directed graph representation of half-rate additive codes over \(\text{GF}(4)\) (Q2430707) (← links)
- Nullity invariance for pivot and the interlace polynomial (Q2431190) (← links)
- Aperiodic propagation criteria for Boolean functions (Q2495652) (← links)
- Graph polynomials derived from Tutte-Martin polynomials (Q2575784) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- A BRACKET POLYNOMIAL FOR GRAPHS, IV: UNDIRECTED EULER CIRCUITS, GRAPH-LINKS AND MULTIPLY MARKED GRAPHS (Q3173279) (← links)
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals (Q6064591) (← links)
- A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors (Q6115787) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
- Prime vertex-minors of a prime graph (Q6201871) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
