The following pages link to Isotropic systems (Q1101116):
Displaying 50 items.
- The adjacency matroid of a graph (Q396844) (← links)
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← 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)
- Orienting transversals and transition polynomials of multimatroids (Q679544) (← 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)
- 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)
- Recombination faults in gene assembly in ciliates modeled using multimatroids (Q896704) (← links)
- Graphic presentations of isotropic systems (Q1113912) (← 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)
- 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)
- Identities for circuit partition polynomials, with applications to the Tutte polynomial (Q1433000) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Sorting by reversals and the theory of 4-regular graphs (Q1682854) (← links)
- Binary functions, degeneracy, and alternating dimaps (Q1732786) (← links)
- Exploring the Tutte-Martin connection (Q1827709) (← links)
- The excluded 3-minors for vf-safe delta-matroids (Q2020023) (← links)
- A characterization of circle graphs in terms of total unimodularity (Q2122669) (← links)
- Isotropic matroids. III: Connectivity (Q2363112) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (Q2427899) (← links)
- Graphs of small rank-width are pivot-minors of graphs of small tree-width (Q2442212) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- Graph polynomials derived from Tutte-Martin polynomials (Q2575784) (← links)
- Transition polynomials (Q2575798) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Rank-width and Well-quasi-ordering of Skew-symmetric Matrices (Q3439350) (← links)
- Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation (Q3540924) (← links)
- Greedy algorithm and symmetric matroids (Q3772000) (← links)
- Digraph Decompositions and Eulerian Systems (Q3781773) (← links)
- Transforming trees by successive local complementations (Q3788053) (← links)
- Connectivity of isotropic systems (Q3972128) (← links)
- Transforming graph states using single-qubit operations (Q4561771) (← links)
- Scattered Classes of Graphs (Q4959761) (← links)
- Matroids that classify forests (Q5047015) (← links)
- Counting single-qubit Clifford equivalent graph states is #P-complete (Q5110740) (← links)
