Oldest pages
Showing below up to 50 results in range #1 to #50.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Element-connectivity (08:42, 22 August 2009)
- Talk:Sandbox2 (09:29, 19 September 2009)
- Kernel (in digraph) (07:57, 19 October 2009)
- Red-blue cut problem (13:34, 22 October 2009)
- Edmonds' disjoint arborescences theorem (18:19, 26 October 2009)
- Convex node set (19:49, 26 October 2009)
- Local edge-connectivity (12:47, 29 October 2009)
- Tutte's disjoint tree theorem (13:35, 3 November 2009)
- Rooted connectivity (16:45, 7 November 2009)
- Deciding the validity of the score sequence of a soccer tournament (15:36, 10 November 2009)
- Decomposing rooted (k,l)-connected graphs into rooted k-connected parts (15:52, 10 November 2009)
- Disjoint spanning in- and out-arborescences (22:44, 11 November 2009)
- Splitting off (15:52, 12 November 2009)
- Talk:Opposite vertices of base polyhedra (22:52, 24 November 2009)
- Nash-Williams' forest cover theorem (16:50, 7 December 2009)
- Laman's theorem (17:06, 7 December 2009)
- Rigidity matrix (17:59, 10 December 2009)
- Talk:Red-blue cut problem (11:35, 18 December 2009)
- Capacity-obeying packing (19:50, 1 January 2010)
- Problem of the month January 2010 (21:02, 1 January 2010)
- Braid and bundle (15:07, 4 January 2010)
- Binary matroid representation of cyclic families (18:20, 10 January 2010)
- Problem of the month February 2010 (16:20, 5 February 2010)
- Lucchesi-Younger theorem (09:58, 9 February 2010)
- Talk:Disjoint spanning in- and out-arborescences (10:11, 9 February 2010)
- In-degree bounded directed forests (16:39, 9 February 2010)
- Partition median problem (16:44, 18 February 2010)
- Node disjoint circuits in Eulerian digraphs (09:30, 7 March 2010)
- Problem of the month April 2010 (14:19, 1 April 2010)
- Talk:Destroying rigidity (11:17, 9 April 2010)
- Problem of the month March 2010 (17:05, 12 April 2010)
- Problem of the month May 2010 (15:29, 10 May 2010)
- Open problem categories (16:23, 22 May 2010)
- List of open problems (16:24, 22 May 2010)
- Talk:Bounded degree matroid basis (17:27, 22 May 2010)
- Bi-set (13:22, 4 June 2010)
- Problem of the month June 2010 (14:44, 4 June 2010)
- Undirected node-connectivity augmentation (17:27, 29 June 2010)
- Problem of the month July 2010 (14:49, 8 July 2010)
- Decomposition of oriented k-partition-connected digraphs (08:54, 19 July 2010)
- Acyclic orientation with parity constraints (14:42, 30 July 2010)
- Talk:In-degree bounded directed forests (09:00, 30 September 2010)
- Rank-respecting augmentation of hypergraphs with negamodular constraints (11:25, 1 December 2010)
- Sandbox2 (15:01, 1 December 2010)
- Talk:Acyclic orientation with parity constraints (06:22, 3 February 2011)
- Dijoin (16:25, 3 February 2011)
- Talk:Characterization of dual-critical graphs (01:42, 11 February 2011)
- Arborescence (18:53, 22 February 2011)
- Capacitated packing of k-arborescences (12:41, 23 February 2011)
- Talk:Maximizing a skew-supermodular function (12:00, 11 March 2011)
