Pages that link to "Item:Q1160629"
From MaRDI portal
The following pages link to Alpha-balanced graphs and matrices and GF(3)-representability of matroids (Q1160629):
Displaying 50 items.
- Oriented hypergraphs: introduction and balance (Q396889) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- Perfect \(0,\pm 1\) matrices (Q677152) (← links)
- Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
- A characterization of oriented hypergraphic balance via signed weak walks (Q745211) (← links)
- Characterizations of ternary matroids in terms of circuit signatures (Q757384) (← links)
- A geometric approach to forbidden minors for GF(3) (Q794659) (← links)
- A decomposition theory for matroids. I: General results (Q801076) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- Signatures and signed switching classes (Q1074603) (← links)
- A decomposition theory for matroids. II. Minimal violation matroids (Q1086241) (← links)
- A decomposition theory for matroids. V: Testing of matrix total unimodularity (Q1103625) (← links)
- A short proof of Tutte's characterization of totally unimodular matrices (Q1122583) (← links)
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices (Q1204474) (← links)
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis (Q1276973) (← links)
- Balanced cycles and holes in bipartite graphs (Q1297428) (← links)
- On matroids with many common bases (Q1301664) (← links)
- On perfect \(0,\pm 1\) matrices (Q1356731) (← links)
- A generalization of Tutte's characterization of totally unimodular matrices (Q1369653) (← links)
- Universally signable graphs (Q1375057) (← links)
- Signed analogs of bipartite graphs (Q1377721) (← links)
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
- Matroids with many common bases. (Q1406555) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- Decomposition of balanced matrices (Q1569060) (← links)
- Negative (and positive) circles in signed graphs: a problem collection (Q1643910) (← links)
- Relaxations of \(\mathrm{GF}(4)\)-representable matroids (Q1648663) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- A note on chromatic number of (cap, even hole)-free graphs (Q1712540) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
- On the efficiency of representability tests for matroids (Q1835922) (← links)
- The excluded minors for GF(4)-representable matroids (Q1850480) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- A short note on some tractable cases of the satisfiability problem. (Q1854345) (← links)
- Decomposition of wheel-and-parachute-free balanced bipartite graphs (Q1900140) (← links)
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality (Q1919803) (← links)
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets (Q2064297) (← links)
- Oriented hypergraphs: balanceability (Q2124629) (← links)
- Matroids are not Ehrhart positive (Q2136552) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- Partial matroid representations (Q2266019) (← links)
- Clique cutsets beyond chordal graphs (Q2413155) (← links)
- Negative circles in signed graphs: a problem collection (Q2413334) (← links)
- Balanced matrices (Q2433704) (← links)
- Matroids with few non-common bases (Q2488944) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- A polynomial recognition algorithm for balanced matrices (Q2565686) (← links)
