Pages that link to "Item:Q5586413"
From MaRDI portal
The following pages link to Minimum partition of a matroid into independent subsets (Q5586413):
Displaying 50 items.
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks (Q273172) (← links)
- Fast approximation for computing the fractional arboricity and extraction of communities of a graph (Q313816) (← links)
- Antistrong digraphs (Q345072) (← links)
- Cyclic orderings and cyclic arboricity of matroids (Q414636) (← links)
- Decomposing a graph into bistars (Q463290) (← links)
- On the tractability of some natural packing, covering and partitioning problems (Q476298) (← links)
- Indicated coloring of matroids (Q477356) (← links)
- A faster algorithm for packing branchings in digraphs (Q494431) (← links)
- Partitioning the bases of the union of matroids (Q507489) (← links)
- The coloring game on matroids (Q507509) (← links)
- On-line list coloring of matroids (Q516838) (← links)
- Two easy duality theorems for product partial orders (Q580378) (← links)
- A combinatorial study of the rigidity of planar structures (Q581093) (← links)
- Circular flow on signed graphs (Q651035) (← links)
- Two results on the rank partition of a matroid (Q658575) (← 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 the toric ideals of matroids of a fixed rank (Q829621) (← links)
- On blockwise symmetric signatures for matchgates (Q846363) (← 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)
- Some bounds on the injective chromatic number of graphs (Q960972) (← links)
- Minors of simplicial complexes (Q967303) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- Edge-decompositions of highly connected graphs into paths (Q1032504) (← links)
- Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
- Sparsity-certifying graph decompositions (Q1043807) (← links)
- On characterizations of rigid graphs in the plane using spanning trees (Q1043809) (← 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)
