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. Weighted bipartite edge colouring‏‎ (3 categories)
  7. Covering a crossing supermodular function with graph edges‏‎ (3 categories)
  8. Decomposing rooted (k,l)-connected graphs into rooted k-connected parts‏‎ (3 categories)
  9. Opposite vertices of base polyhedra‏‎ (3 categories)
  10. Changing conservative weightings in bipartite graphs‏‎ (3 categories)
  11. Disjoint strongly connected spanning subgraphs‏‎ (3 categories)
  12. Goddyn's conjecture on thin spanning trees‏‎ (3 categories)
  13. Independent trees‏‎ (3 categories)
  14. Min-sum two edge-disjoint paths‏‎ (3 categories)
  15. Covering a crossing supermodular function with pairwise non-parallel arcs‏‎ (3 categories)
  16. Orientation-compatible w-vertex cover‏‎ (3 categories)
  17. Minimum k-way cut in a hypergraph‏‎ (3 categories)
  18. Well-balanced orientations of hypergraphs‏‎ (3 categories)
  19. Berge's conjecture on path partitions‏‎ (3 categories)
  20. Covering a symmetric crossing supermodular function with hyperedges of prescribed size‏‎ (3 categories)
  21. Decomposition into two trees with orientation constraints‏‎ (3 categories)
  22. Orientation conjecture of Nash-Williams‏‎ (3 categories)
  23. Quasi-kernels and quasi-sinks‏‎ (3 categories)
  24. Characterization of graphs having a k-connected orientation‏‎ (3 categories)
  25. Partitioning a bipartite graph into proportional factors‏‎ (3 categories)
  26. Skew-supermodular list colouring‏‎ (3 categories)
  27. Woodall's conjecture‏‎ (3 categories)
  28. Decomposition of oriented k-partition-connected digraphs‏‎ (3 categories)
  29. Orientation of nonideal clutters‏‎ (3 categories)
  30. Rainbow matchings in bipartite graphs‏‎ (3 categories)
  31. Characterizing integral g-polymatroids‏‎ (3 categories)
  32. Highly element-connected orientation‏‎ (3 categories)
  33. Acyclic orientation with connectivity prescriptions‏‎ (3 categories)
  34. Orientation with shortest round trip‏‎ (3 categories)
  35. Maximum size of a source-sink reorientable set‏‎ (3 categories)
  36. Polyhedral description of kernels‏‎ (3 categories)
  37. Exact matching in red-blue bipartite graphs‏‎ (3 categories)
  38. Smooth well-balanced orientations with prescribed in-degrees‏‎ (3 categories)
  39. Destroying rigidity‏‎ (3 categories)
  40. Recognition of Seymour graphs‏‎ (3 categories)
  41. Strongly maximal matchings, strongly minimal vertex covers‏‎ (3 categories)
  42. Edge-disjoint T-connectors‏‎ (3 categories)
  43. Maximum square-free 2-matching‏‎ (3 categories)
  44. Edge-disjoint spanning trees and paths‏‎ (3 categories)
  45. Scrambled Rota conjecture‏‎ (3 categories)
  46. Constructive characterization of dumpy graphs‏‎ (3 categories)
  47. Expressing vectors using bases of a matroid‏‎ (3 categories)
  48. Kriesell's conjecture‏‎ (3 categories)
  49. Capacitated packing of k-arborescences‏‎ (3 categories)
  50. Parity constrained strongly connected orientations‏‎ (3 categories)

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