Pages with the most categories
Showing below up to 50 results in range #1 to #50.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- List colouring of two matroids (4 categories)
- Skew-supermodular colouring with prescribed class-sizes (4 categories)
- Edge-covering number of 2-polymatroids (4 categories)
- Skew-supermodular colouring with two class sizes (4 categories)
- Well-balanced orientations of hypergraphs (4 categories)
- Strong colouring of matroid-graph pairs (4 categories)
- Kriesell's conjecture (3 categories)
- Smooth well-balanced orientations with prescribed in-degrees (3 categories)
- Disjoint spanning in- and out-arborescences (3 categories)
- Generic global rigidity in three dimensions (3 categories)
- Parity constrained strongly connected orientations (3 categories)
- Strongly maximal matchings (3 categories)
- Covering a crossing supermodular function with graph edges (3 categories)
- Maximum weight bounded fractional matching (3 categories)
- Decomposing rooted (k,l)-connected graphs into rooted k-connected parts (3 categories)
- Changing conservative weightings in bipartite graphs (3 categories)
- Disjoint strongly connected spanning subgraphs (3 categories)
- Generic rigidity in three dimensions (3 categories)
- Covering a crossing supermodular function with pairwise non-parallel arcs (3 categories)
- Maximum weight k-element subsets of perfect matchings (3 categories)
- Scrambled Rota conjecture (3 categories)
- Goddyn's conjecture on thin spanning trees (3 categories)
- Covering a symmetric crossing supermodular function with hyperedges of prescribed size (3 categories)
- Upper bound on common independent set cover (3 categories)
- Berge's conjecture on path partitions (3 categories)
- Decomposition into two trees with orientation constraints (3 categories)
- Opposite vertices of base polyhedra (3 categories)
- Characterization of graphs having a k-connected orientation (3 categories)
- Independent trees (3 categories)
- Min-sum two edge-disjoint paths (3 categories)
- Decomposition of oriented k-partition-connected digraphs (3 categories)
- Orientation-compatible w-vertex cover (3 categories)
- Characterizing integral g-polymatroids (3 categories)
- Acyclic orientation with connectivity prescriptions (3 categories)
- Minimum k-way cut in a hypergraph (3 categories)
- Weighted bipartite edge colouring (3 categories)
- Orientation conjecture of Nash-Williams (3 categories)
- Quasi-kernels and quasi-sinks (3 categories)
- Partitioning a bipartite graph into proportional factors (3 categories)
- Orientation of nonideal clutters (3 categories)
- Rainbow matchings in bipartite graphs (3 categories)
- Destroying rigidity (3 categories)
- Edge-disjoint T-connectors (3 categories)
- Highly element-connected orientation (3 categories)
- Rota's conjecture on disjoint bases (3 categories)
- Exact matching in red-blue bipartite graphs (3 categories)
- Skew-supermodular list colouring (3 categories)
- Woodall's conjecture (3 categories)
- Orientation with shortest round trip (3 categories)
- Constructive characterization of dumpy graphs (3 categories)
