The following pages link to (Q4111952):
Displaying 50 items.
- 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)
- Matroid polytopes and their volumes (Q972610) (← links)
- Rigidity, global rigidity, and graph decomposition (Q973100) (← links)
- Categories of bi-fuzzy pre-matroids (Q980204) (← links)
- Axioms for bases of closed regular fuzzy matroids (Q983042) (← links)
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
- A combinatorial proof of the Rayleigh formula for graphs (Q998327) (← links)
- Concerning the shape of a geometric lattice (Q998407) (← links)
- A generalization of Kneser's addition theorem (Q1007230) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
- Frame cellular automata: Configurations, generating sets and related matroids (Q1024429) (← links)
- Matroid algorithm for monitorability analysis of bond graphs (Q1033116) (← links)
- \((L,M)\)-fuzzy matroids (Q1040920) (← links)
- A quasisymmetric function for matroids (Q1041594) (← links)
- Ehrhart polynomials of matroid polytopes and polymatroids (Q1042445) (← links)
- Maximal Sidon sets and matroids (Q1043980) (← links)
- Bivalent trees and forests or upper bounds for the probability of a union revisited (Q1051331) (← links)
- Balanced sets in an independence structure induced by a submodular function (Q1051650) (← links)
- On a characterization of Dilworth truncations of combinatorial geometries (Q1051894) (← links)
- Unions of oriented matroids (Q1053022) (← links)
- Arbres minimaux d'un graphe preordonne (Q1053701) (← links)
- Nowhere-zero integral flows on a bidirected graph (Q1053716) (← links)
- A class of matroids derived from saturated chain partitions of partially ordered sets (Q1054739) (← links)
- On matroids of the greatest W-connectivity (Q1054741) (← links)
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space (Q1055792) (← links)
- Testing membership in matroid polyhedra (Q1056350) (← links)
- On the complexity of recognizing a class of generalized networks (Q1058995) (← links)
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications (Q1062429) (← links)
- Polarity and inner products in oriented matroids (Q1063035) (← links)
- Boolean techniques for matroidal decomposition of independence systems and applications to graphs (Q1063611) (← links)
- Modularity in tangential k-blocks (Q1066147) (← links)
- An Erdős-Gallai conjecture (Q1068106) (← links)
- Circuit preserving edge maps. II (Q1068854) (← links)
- Nowhere zero flow and circuit covering in regular matroids (Q1070235) (← links)
- Connectivity in bicircular matroids (Q1070236) (← links)
- On theories of Whitney and Tutte (Q1070237) (← links)
- A characterization of the ternary matroids with no \(M(K_ 4)\)-minor (Q1071023) (← links)
- First-order theories of abstract dependence relations (Q1073012) (← links)
- Algebraic characteristic sets of matroids (Q1073802) (← links)
- Directed switching games on graphs and matroids (Q1074519) (← links)
- On determination of graph G whose bond lattice \({\mathcal L}(G)\) is modular (Q1075343) (← links)
- Matroidal games (Q1076623) (← links)
- Upper bounds for the cardinality of s-distances codes (Q1077373) (← links)
- On Tutte polynomials and cycles of plane graphs (Q1077427) (← links)
- On the decomposition of vector spaces (Q1078151) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
