Pages that link to "Item:Q5586413"
From MaRDI portal
The following pages link to Minimum partition of a matroid into independent subsets (Q5586413):
Displayed 50 items.
- Two easy duality theorems for product partial orders (Q580378) (← links)
- A combinatorial study of the rigidity of planar structures (Q581093) (← links)
- Reliable assignments of processors to tasks and factoring on matroids (Q685664) (← links)
- Subtree and substar intersection numbers (Q686262) (← links)
- Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- On factorial double solids with simple double points (Q856356) (← links)
- Factorial hypersurfaces in \(\mathbb{P}^4\) with nodes (Q861683) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Factoriality condition of some nodal threefolds in \({\mathbb{P}^4}\) (Q958177) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space (Q1055792) (← links)
- Testing membership in matroid polyhedra (Q1056350) (← links)
- An integer analogue of Carathéodory's theorem (Q1074117) (← links)
- The principal partition of a pair of graphs and its applications (Q1091404) (← links)
- An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
- Simultaneous diagonal congruences (Q1101478) (← links)
- Pseudomatroids (Q1109779) (← links)
- Ordering of the elements of a matroid such that its consecutive w elements are independent (Q1110522) (← links)
- Edge-packings of graphs and network reliability (Q1111461) (← links)
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity) (Q1114713) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- On the spanning tree polyhedron (Q1122482) (← links)
- Flows and generalized coloring theorems in graphs (Q1133552) (← links)
- 2-linked graphs (Q1150633) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Some results on visibility graphs (Q1201816) (← links)
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties (Q1204467) (← links)
- A note on the arboricity of graphs (Q1205341) (← links)
- Binary multiples of combinatorial geometries. I, II (Q1211992) (← links)
- Edge-disjoint spanning trees and depth-first search (Q1217713) (← links)
- Distances in orientations of graphs (Q1219300) (← links)
- On maximally distant spanning trees of a graph (Q1229218) (← links)
- Relative complexity of checking and evaluating (Q1232181) (← links)
- The basis monomial ring of a matroid (Q1237740) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- The \(\beta\)-assignment problems (Q1291693) (← links)
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems (Q1310005) (← links)
- Monotone path systems in simple regions (Q1323475) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- On certain polytopes associated with graphs (Q1393418) (← links)
- Improved bound for the Carathéodory rank of the bases of a matroid (Q1400967) (← links)
- Cliques in dense GF(\(q\))-representable matroids (Q1405118) (← links)
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs (Q1410689) (← links)
- Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs (Q1410701) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Applications of matroid partition to tree decomposition (Q1568255) (← links)
- The projective geometry of the Gale transform. (Q1583646) (← links)