Jump to content

Kőnig's theorem (graph theory): Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)

4 September 2013

  • curprev 18:3318:33, 4 September 2013 Will Orrick talk contribs 16,500 bytes −741 improve wording of "Proof"; move "Algorithm" after "Proof"; the construction of the minimum vertex cover given under "Algorithm" is a variant of the one given under "Proof" and the latter is actually described more algorithmically, so remove the former undo

31 August 2013

24 August 2013

22 August 2013

26 July 2013

17 May 2013

29 April 2013

27 February 2013

20 January 2013

15 August 2012

4 August 2012

21 May 2012

7 May 2012

17 March 2012

15 March 2012

10 March 2012

15 October 2011

30 July 2011

9 April 2011

12 March 2011

21 February 2011

4 December 2010

3 December 2010

22 November 2010

21 November 2010

10 October 2010

15 July 2010

10 April 2010

2 January 2010

28 November 2009

14 October 2009

9 October 2009

22 September 2009

2 September 2009

1 September 2009

20 July 2009

17 May 2009

6 March 2009

17 February 2009

(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)