The following pages link to (Q4111952):
Displayed 50 items.
- Hamiltonicity in (0-1)-polyhedra (Q796554) (← links)
- The matroidal knapsack: A class of (often) well-solvable problems (Q797497) (← links)
- An algebraic and combinatorial approach to the analysis of line drawings of polyhedra (Q798004) (← links)
- On D-complementation (Q798326) (← links)
- On minor-minimally-connected matroids (Q798327) (← links)
- Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings (Q798337) (← links)
- A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean (Q800365) (← links)
- A note on nongraphic matroids (Q801072) (← links)
- A characterization of matroidal families of multigraphs (Q801074) (← links)
- A decomposition theory for matroids. I: General results (Q801076) (← links)
- A characterization of circle graphs (Q801089) (← links)
- Injection geometries (Q801926) (← links)
- On adjoints and dual matroids (Q803143) (← links)
- A unifying approach to the structures of the stable matching problems (Q808729) (← links)
- Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
- On finite matroids with two more hyperplanes than points (Q819809) (← links)
- Chromatic zeros on hierarchical lattices and equidistribution on parameter space (Q824267) (← links)
- Homological properties of Orlik-Solomon algebras (Q834808) (← links)
- Representations of matroids and free resolutions for multigraded modules (Q854097) (← links)
- Defining matroids through sequential selection (Q854847) (← links)
- Extreme point axioms for closure spaces (Q856869) (← links)
- Linear spaces, transversal polymatroids and ASL domains (Q857751) (← links)
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855) (← links)
- Closure axioms for a class of fuzzy matroids and co-towers of matroids (Q881826) (← links)
- Matroids on convex geometries (cg-matroids) (Q882114) (← links)
- Bruhat interval polytopes (Q887320) (← links)
- Static and dynamic source locations in undirected networks (Q889101) (← links)
- The critical number of dense triangle-free binary matroids (Q896002) (← links)
- Recombination faults in gene assembly in ciliates modeled using multimatroids (Q896704) (← links)
- Detecting minors in matroids through triangles (Q901153) (← links)
- A formula for simplicial tree-numbers of matroid complexes (Q901154) (← links)
- Combinatorial geometries representable over GF(3) and GF(q). I: The number of points (Q911051) (← links)
- The structure of bases in bicircular matroids (Q912110) (← links)
- Matroidizing set systems: A new approach to matroid theory (Q913804) (← links)
- Extensions of line-closed combinatorial geometries (Q914148) (← links)
- Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries (Q915122) (← links)
- Notes on dimensional closure spaces (Q915170) (← links)
- k-sum optimization problems (Q916568) (← links)
- Decomposition of partial orders (Q919013) (← links)
- On multivariate E-splines (Q919209) (← links)
- Matchings and \(\Delta\)-matroids (Q920097) (← links)
- On the exact evaluation of certain instances of the Potts partition function by quantum computers (Q926258) (← links)
- Cubes and orientability (Q932682) (← links)
- A MacWilliams type identity for matroids (Q941399) (← links)
- Rank functions of strict cg-matroids (Q942102) (← links)
- On chromatic and flow polynomial unique graphs (Q947115) (← links)
- Short cycle structure of graphs on surfaces. I: The uniqueness theorems (Q950676) (← links)
- A unified interpretation of several combinatorial dualities (Q951109) (← links)
- Note on pseudolattices, lattices and submodular linear programs (Q951121) (← links)
- Degree conditions for group connectivity (Q966042) (← links)