Graph toughness: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

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

curprev 07:4807:48, 16 July 2024‎ 666-Bandera Mouse talk contribs‎ 5,631 bytes +34‎ No edit summary undo

curprev 20:5420:54, 29 January 2023‎ OAbot talk contribs‎ m 5,597 bytes +21‎ Open access bot: doi added to citation with #oabot. undo

curprev 06:1406:14, 6 July 2021‎ OAbot talk contribs‎ m 5,576 bytes +42‎ Open access bot: doi added to citation with #oabot. undo

curprev 17:0417:04, 6 September 2020‎ Citation bot talk contribs‎ 5,534 bytes +170‎ Add: url, issue, s2cid. Formatted dashes. | You can use this bot yourself. Report bugs here. | Suggested by SemperIocundus | via #UCB_webform undo

curprev 21:4821:48, 24 March 2017‎ 93.85.15.248 talk‎ 5,364 bytes +7‎ No edit summary undo

curprev 03:0703:07, 21 November 2016‎ David Eppstein talk contribs‎ m 5,357 bytes +1‎ →‎Connection to Hamiltonicity: missing period undo
curprev 03:0603:06, 21 November 2016‎ David Eppstein talk contribs‎ 5,356 bytes +66‎ →‎See also: Strength of a graph undo

curprev 23:3623:36, 30 September 2016‎ David Eppstein talk contribs‎ 5,290 bytes +63‎ →‎Connection to Hamiltonicity: name undo
curprev 00:5100:51, 30 September 2016‎ David Eppstein talk contribs‎ 5,227 bytes +117‎ →‎Connection to Hamiltonicity: unsolved undo

curprev 20:5920:59, 11 July 2016‎ David Eppstein talk contribs‎ 5,110 bytes +114‎ see also Tutte–Berge formula, a related characterization of the size of a maximum matching in a graph undo

curprev 01:4701:47, 31 January 2016‎ David Eppstein talk contribs‎ m 4,996 bytes +4‎ →‎References: link Graphs and Combinatorics undo

curprev 21:2421:24, 19 September 2015‎ David Eppstein talk contribs‎ 4,992 bytes +779‎ computational complexity undo

curprev 05:5605:56, 22 August 2015‎ David Eppstein talk contribs‎ 4,213 bytes −25‎ fix inconsistent math formatting undo
curprev 05:5205:52, 22 August 2015‎ David Eppstein talk contribs‎ 4,238 bytes −2‎ →‎References: Hack for inability to have sub-title references in journals. Trappist the monk won't let me do this in a way that gets the metadata right, so get it wrong. undo
curprev 05:5105:51, 22 August 2015‎ David Eppstein talk contribs‎ m 4,240 bytes 0‎ →‎top: typo in ref undo

curprev 12:1712:17, 12 July 2014‎ 129.132.209.124 talk‎ 4,240 bytes +77‎ →‎Examples undo

curprev 21:3321:33, 20 January 2014‎ 84.106.87.195 talk‎ 4,163 bytes −73‎ added clarification to first image description "(depicted in four different colours)" undo
curprev 21:3221:32, 20 January 2014‎ 84.106.87.195 talk‎ 4,236 bytes +110‎ added clarification to first image description "(depicted in four different colours)" undo

curprev 08:1808:18, 22 February 2013‎ David Eppstein talk contribs‎ 4,126 bytes +43‎ →‎Connection to Hamiltonicity: Fleischner's theorem undo

curprev 05:2105:21, 21 February 2013‎ David Eppstein talk contribs‎ m 4,083 bytes +35‎ dab connected components undo

curprev 21:5921:59, 27 August 2012‎ David Eppstein talk contribs‎ 4,048 bytes +516‎ examples undo
curprev 21:5521:55, 27 August 2012‎ David Eppstein talk contribs‎ 3,532 bytes +833‎ sectionize and call it start class instead of a stub undo

curprev 12:3812:38, 22 June 2012‎ 70.247.166.5 talk‎ 2,699 bytes +17‎ avoid redirect undo

curprev 16:0316:03, 19 June 2011‎ Citation bot 1 talk contribs‎ m 2,682 bytes −14‎ [Pu380]Add: mr. Tweak: pages. Formatted dashes. undo

curprev 18:0218:02, 9 May 2011‎ David Eppstein talk contribs‎ 2,696 bytes +51‎ declare the variable types undo

curprev 21:4621:46, 31 January 2011‎ David Eppstein talk contribs‎ 2,645 bytes +264‎ illo undo
curprev 18:1118:11, 31 January 2011‎ David Eppstein talk contribs‎ m 2,381 bytes +1‎ →‎References: * undo
curprev 18:1118:11, 31 January 2011‎ David Eppstein talk contribs‎ m 2,380 bytes +324‎ formatting and copyediting undo

curprev 18:4318:43, 17 November 2009‎ David Eppstein talk contribs‎ m 2,056 bytes +30‎ +cat undo
curprev 18:4318:43, 17 November 2009‎ David Eppstein talk contribs‎ m 2,026 bytes +2‎ cat undo

curprev 22:3422:34, 25 June 2009‎ Pvazteixeira talk contribs‎ m 2,024 bytes +13‎ No edit summary undo
curprev 22:0322:03, 25 June 2009‎ Pvazteixeira talk contribs‎ m 2,011 bytes +15‎ updated the connectivity link undo

curprev 21:3021:30, 15 March 2009‎ Igorpak talk contribs‎ m 1,996 bytes +35‎ →‎References: +DM link undo

curprev 05:0705:07, 27 February 2009‎ David Eppstein talk contribs‎ m 1,961 bytes +4‎ wikify undo

curprev 23:1823:18, 22 May 2007‎ David Eppstein talk contribs‎ 1,957 bytes +4‎ +cat undo
curprev 22:0922:09, 22 May 2007‎ Fabrictramp talk contribs‎ 1,953 bytes +28‎ Dead-end pages clean up project; you can help! using AWB undo

curprev 23:2023:20, 27 April 2007‎ Michael Hardy talk contribs‎ m 1,925 bytes +16‎ No edit summary undo

curprev 03:0903:09, 24 April 2007‎ David Eppstein talk contribs‎ m 1,909 bytes 0‎ stronger vertex connectivity undo
curprev 03:0603:06, 24 April 2007‎ David Eppstein talk contribs‎ m 1,909 bytes +17‎ m undo
curprev 03:0403:04, 24 April 2007‎ David Eppstein talk contribs‎ 1,892 bytes +1,561‎ Expand after prod, enough to guard against accusations of OR. It will take significantly more effort to digest and condense the BBS survey to produce a real article rather than a stub. undo
curprev 02:4302:43, 24 April 2007‎ David Eppstein talk contribs‎ 331 bytes −281‎ rm prod. This is not original research, as the prod erroneously claims. Will add appropriate references after taking the time to do a proper search. undo

curprev 16:0616:06, 23 April 2007‎ Part Deux talk contribs‎ 612 bytes +281‎ prod undo

curprev 07:2307:23, 16 January 2007‎ David Eppstein talk contribs‎ m 331 bytes −16‎ stub sorting undo

curprev 14:5214:52, 9 January 2007‎ Sjord talk contribs‎ 347 bytes +84‎ No edit summary undo
curprev 14:3614:36, 9 January 2007‎ Sjord talk contribs‎ 263 bytes +33‎ No edit summary undo
curprev 14:3414:34, 9 January 2007‎ Sjord talk contribs‎ 230 bytes +230‎ ←Created page with 'Let ω(G) denote the number of components of a graph G. A graph G is t-tough if |S| ≥ tω(G − S) for every subset S of the vertex set V (G) with ω(G − S) > 1...'

16 July 2024

29 January 2023

6 July 2021

6 September 2020

24 March 2017

21 November 2016

30 September 2016

11 July 2016

31 January 2016

19 September 2015

22 August 2015

12 July 2014

20 January 2014

22 February 2013

21 February 2013

27 August 2012

22 June 2012

19 June 2011

9 May 2011

31 January 2011

17 November 2009

25 June 2009

15 March 2009

27 February 2009

22 May 2007

27 April 2007

24 April 2007

23 April 2007

16 January 2007

9 January 2007