Pages with the most categories

Jump to: navigation, search

Showing below up to 50 results in range #1 to #50.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Skew-supermodular colouring with prescribed class-sizes‏‎ (4 categories)
  2. Skew-supermodular colouring with two class sizes‏‎ (4 categories)
  3. List colouring of two matroids‏‎ (4 categories)
  4. Strong colouring of matroid-graph pairs‏‎ (4 categories)
  5. Edge-covering number of 2-polymatroids‏‎ (4 categories)
  6. Scrambled Rota conjecture‏‎ (3 categories)
  7. Edge-independent spanning trees‏‎ (3 categories)
  8. Deciding the existence of popular matchings‏‎ (3 categories)
  9. Expressing vectors using bases of a matroid‏‎ (3 categories)
  10. Kriesell's conjecture‏‎ (3 categories)
  11. Compactness of Kőnig-property‏‎ (3 categories)
  12. Parity constrained strongly connected orientations‏‎ (3 categories)
  13. Upper bound on common independent set cover‏‎ (3 categories)
  14. Are t-perfect graphs strongly t-perfect?‏‎ (3 categories)
  15. Maximum weight bounded fractional matching‏‎ (3 categories)
  16. Disjoint spanning in- and out-arborescences‏‎ (3 categories)
  17. Generic global rigidity in three dimensions‏‎ (3 categories)
  18. Covering a crossing supermodular function with graph edges‏‎ (3 categories)
  19. Maximum weight k-element subsets of perfect matchings‏‎ (3 categories)
  20. Changing conservative weightings in bipartite graphs‏‎ (3 categories)
  21. Decomposing rooted (k,l)-connected graphs into rooted k-connected parts‏‎ (3 categories)
  22. Disjoint strongly connected spanning subgraphs‏‎ (3 categories)
  23. Generic rigidity in three dimensions‏‎ (3 categories)
  24. Weighted bipartite edge colouring‏‎ (3 categories)
  25. Covering a crossing supermodular function with pairwise non-parallel arcs‏‎ (3 categories)
  26. Opposite vertices of base polyhedra‏‎ (3 categories)
  27. Goddyn's conjecture on thin spanning trees‏‎ (3 categories)
  28. Berge's conjecture on path partitions‏‎ (3 categories)
  29. Covering a symmetric crossing supermodular function with hyperedges of prescribed size‏‎ (3 categories)
  30. Independent trees‏‎ (3 categories)
  31. Min-sum two edge-disjoint paths‏‎ (3 categories)
  32. Characterization of graphs having a k-connected orientation‏‎ (3 categories)
  33. Decomposition into two trees with orientation constraints‏‎ (3 categories)
  34. Orientation-compatible w-vertex cover‏‎ (3 categories)
  35. Well-balanced orientations of hypergraphs‏‎ (3 categories)
  36. Minimum k-way cut in a hypergraph‏‎ (3 categories)
  37. Characterizing integral g-polymatroids‏‎ (3 categories)
  38. Decomposition of oriented k-partition-connected digraphs‏‎ (3 categories)
  39. Orientation conjecture of Nash-Williams‏‎ (3 categories)
  40. Quasi-kernels and quasi-sinks‏‎ (3 categories)
  41. Partitioning a bipartite graph into proportional factors‏‎ (3 categories)
  42. Skew-supermodular list colouring‏‎ (3 categories)
  43. Woodall's conjecture‏‎ (3 categories)
  44. Orientation of nonideal clutters‏‎ (3 categories)
  45. Rainbow matchings in bipartite graphs‏‎ (3 categories)
  46. Acyclic orientation with connectivity prescriptions‏‎ (3 categories)
  47. Highly element-connected orientation‏‎ (3 categories)
  48. Destroying rigidity‏‎ (3 categories)
  49. Orientation with shortest round trip‏‎ (3 categories)
  50. Edge-disjoint T-connectors‏‎ (3 categories)

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)