Oldest pages

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. Element-connectivity‏‎ (08:42, 22 August 2009)
  2. Talk:Sandbox2‏‎ (09:29, 19 September 2009)
  3. Kernel (in digraph)‏‎ (07:57, 19 October 2009)
  4. Red-blue cut problem‏‎ (13:34, 22 October 2009)
  5. Edmonds' disjoint arborescences theorem‏‎ (18:19, 26 October 2009)
  6. Convex node set‏‎ (19:49, 26 October 2009)
  7. Well-balanced orientations of hypergraphs‏‎ (19:06, 28 October 2009)
  8. Local edge-connectivity‏‎ (12:47, 29 October 2009)
  9. Tutte's disjoint tree theorem‏‎ (13:35, 3 November 2009)
  10. Rooted connectivity‏‎ (16:45, 7 November 2009)
  11. Deciding the validity of the score sequence of a soccer tournament‏‎ (15:36, 10 November 2009)
  12. Decomposing rooted (k,l)-connected graphs into rooted k-connected parts‏‎ (15:52, 10 November 2009)
  13. Disjoint spanning in- and out-arborescences‏‎ (22:44, 11 November 2009)
  14. Splitting off‏‎ (15:52, 12 November 2009)
  15. Maximum weakly stable matchings in graphs without odd preference cycles‏‎ (11:16, 19 November 2009)
  16. Talk:Opposite vertices of base polyhedra‏‎ (22:52, 24 November 2009)
  17. Smooth well-balanced orientations with prescribed in-degrees‏‎ (14:39, 4 December 2009)
  18. Nash-Williams' forest cover theorem‏‎ (16:50, 7 December 2009)
  19. Laman's theorem‏‎ (17:06, 7 December 2009)
  20. Rigidity matrix‏‎ (17:59, 10 December 2009)
  21. Talk:Red-blue cut problem‏‎ (11:35, 18 December 2009)
  22. Capacity-obeying packing‏‎ (19:50, 1 January 2010)
  23. Problem of the month January 2010‏‎ (21:02, 1 January 2010)
  24. Braid and bundle‏‎ (15:07, 4 January 2010)
  25. Binary matroid representation of cyclic families‏‎ (18:20, 10 January 2010)
  26. Problem of the month February 2010‏‎ (16:20, 5 February 2010)
  27. Lucchesi-Younger theorem‏‎ (09:58, 9 February 2010)
  28. Talk:Disjoint spanning in- and out-arborescences‏‎ (10:11, 9 February 2010)
  29. In-degree bounded directed forests‏‎ (16:39, 9 February 2010)
  30. Partition median problem‏‎ (16:44, 18 February 2010)
  31. Node disjoint circuits in Eulerian digraphs‏‎ (09:30, 7 March 2010)
  32. Problem of the month April 2010‏‎ (14:19, 1 April 2010)
  33. Talk:Destroying rigidity‏‎ (11:17, 9 April 2010)
  34. Problem of the month March 2010‏‎ (17:05, 12 April 2010)
  35. Problem of the month May 2010‏‎ (15:29, 10 May 2010)
  36. Open problem categories‏‎ (16:23, 22 May 2010)
  37. List of open problems‏‎ (16:24, 22 May 2010)
  38. Talk:Bounded degree matroid basis‏‎ (17:27, 22 May 2010)
  39. Bi-set‏‎ (13:22, 4 June 2010)
  40. Problem of the month June 2010‏‎ (14:44, 4 June 2010)
  41. Undirected node-connectivity augmentation‏‎ (17:27, 29 June 2010)
  42. Problem of the month July 2010‏‎ (14:49, 8 July 2010)
  43. Decomposition of oriented k-partition-connected digraphs‏‎ (08:54, 19 July 2010)
  44. Acyclic orientation with parity constraints‏‎ (14:42, 30 July 2010)
  45. Talk:In-degree bounded directed forests‏‎ (09:00, 30 September 2010)
  46. Rank-respecting augmentation of hypergraphs with negamodular constraints‏‎ (11:25, 1 December 2010)
  47. Sandbox2‏‎ (15:01, 1 December 2010)
  48. Talk:Acyclic orientation with parity constraints‏‎ (06:22, 3 February 2011)
  49. Dijoin‏‎ (16:25, 3 February 2011)
  50. Talk:Characterization of dual-critical graphs‏‎ (01:42, 11 February 2011)

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