The following pages link to (Q4111952):
Displaying 50 items.
- On the two-dimensional generic rigidity matroid and its dual (Q1186124) (← links)
- Multicolored forests in bipartite decompositions of graphs (Q1186126) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- A short proof that matching matroids are transversal (Q1186958) (← links)
- Perfect matroids (Q1188443) (← links)
- Valuated matroids (Q1191727) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- Unimodular equivalence of graphs (Q1194290) (← links)
- A minimal 3-connectedness result for matroids (Q1195474) (← links)
- The notion and basic properties of \(M\)-transversals (Q1196992) (← links)
- Paroids: A canonical format for combinatorial optimization (Q1199464) (← links)
- Connectivity of submodular functions (Q1199483) (← links)
- Dilworth truncations and \(k\)-induced matroids (Q1199486) (← links)
- Cycle lengths and circuit matroids of graphs (Q1199495) (← links)
- Invertibility of the base Radon transform of a matroid (Q1201244) (← links)
- Extensions of Tutte's wheels-and-whirls theorem (Q1204468) (← links)
- A note on the \(f\)-factor-lattice of bipartite graphs (Q1204470) (← links)
- The complexity of finding arborescences in hypergraphs (Q1205723) (← links)
- Duality in graph families (Q1208357) (← links)
- Fractional arboricity, strength, and principal partitions in graphs and matroids (Q1208447) (← links)
- Recognizing hidden bicircular networks (Q1208462) (← links)
- Cover preserving embedding of modular lattices into partition lattices (Q1210563) (← links)
- The matroids with the max-flow min-cut property (Q1245970) (← links)
- Matroids from directed graphs (Q1250104) (← links)
- On cographic regular matroids (Q1252861) (← links)
- Vector representable matroids of given rank with given automorphism group (Q1252862) (← links)
- Bimatroids and invariants (Q1254324) (← links)
- An extension of Tutte's 1-factor theorem (Q1256496) (← links)
- On Hartfiel and Maxson's definition of connected sets of a matroid (Q1258750) (← links)
- On matroidal families (Q1258755) (← links)
- Non-regular simplicial matroids (Q1259548) (← links)
- Geometries simpliciales unimodulaires (Q1259550) (← links)
- Some extremal connectivity results for matroids (Q1262315) (← links)
- Note on a matroid with parity condition (Q1262317) (← links)
- An abstract duality (Q1262319) (← links)
- A characterization of certain excluded-minor classes of matroids (Q1263591) (← links)
- On infinite Goldie dimension (Q1270388) (← links)
- A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
- Clutters and circuits. II (Q1271872) (← links)
- Matroids on partially ordered sets (Q1271880) (← links)
- On packing connectors (Q1272488) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- Linear programs for constraint satisfaction problems (Q1278588) (← links)
- A three-dimensional matching model for perishable production scheduling (Q1283066) (← links)
- A homological approach to two problems on finite sets (Q1283453) (← links)
- Discrete convex analysis (Q1290668) (← links)
- Two-best solutions under distance constraints: The model and exemplary results for matroids (Q1291060) (← links)
- On the connectivity of random subsets of projective spaces (Q1297410) (← links)
- Test sets of integer programs (Q1298753) (← links)
- Matroid representations by partitions (Q1301662) (← links)
