Graph factorization: Revision history

7 March 2024

• curprev 00:2900:29, 7 March 2024‎ Jayy V talk contribs‎ m 11,364 bytes +169‎ No edit summary undo

14 February 2024

• curprev 13:2613:26, 14 February 2024‎ Sir Ibee talk contribs‎ 11,195 bytes +59‎ Open access status updates in citations with OAbot #oabot undo Tag: OAbot [2.1]

28 November 2023

• curprev 21:3221:32, 28 November 2023‎ OAbot talk contribs‎ m 11,136 bytes −12‎ Open access bot: doi updated in citation with #oabot. undo

21 June 2023

• curprev 06:1806:18, 21 June 2023‎ McKay talk contribs‎ 11,148 bytes +20‎ →‎top: not any old edge coloring undo

14 February 2023

• curprev 14:1114:11, 14 February 2023‎ Dewritech talk contribs‎ m 11,128 bytes +2‎ clean up, typo(s) fixed: ie, → i.e., undo Tag: AWB

21 July 2022

• curprev 08:2008:20, 21 July 2022‎ McKay talk contribs‎ 11,126 bytes +2‎ →‎References: ditto undo
• curprev 08:1908:19, 21 July 2022‎ McKay talk contribs‎ 11,124 bytes +5‎ →‎Notes: standard section title undo

19 May 2022

• curprev 20:2020:20, 19 May 2022‎ ינון גלעדי talk contribs‎ 11,119 bytes +27‎ →‎Further reading undo

6 July 2021

• curprev 04:4204:42, 6 July 2021‎ OAbot talk contribs‎ m 11,092 bytes +76‎ Open access bot: doi added to citation with #oabot. undo

1 February 2021

• curprev 06:3906:39, 1 February 2021‎ Monkbot talk contribs‎ m 11,016 bytes +6‎ Task 18 (cosmetic): eval 11 templates: hyphenate params (6×); undo Tag: AWB

15 August 2020

• curprev 20:0220:02, 15 August 2020‎ 2601:84:8a00:27b0:d91a:f72:72b:147c talk‎ 11,010 bytes −160‎ →‎Complete graphs undo Tag: Manual revert
• curprev 20:0020:00, 15 August 2020‎ 2601:84:8a00:27b0:d91a:f72:72b:147c talk‎ 11,170 bytes +160‎ →‎Complete graphs undo

5 August 2020

• curprev 00:4600:46, 5 August 2020‎ David Eppstein talk contribs‎ 11,010 bytes +130‎ Undid revision 971246833 by 184.161.107.105 (talk) "is 2-factorable" means "can be partitioned into two perfect matchings", and does not mean "has a 2-factor" undo Tag: Undo

4 August 2020

• curprev 23:5323:53, 4 August 2020‎ 184.161.107.105 talk‎ 10,880 bytes −130‎ →‎2-factorization: The previous version stated that: "If a graph is 2-factorable, then it has to be 2k-regular for some integer k." This is directly contradicted by the Petersen graph, which is 3-regular and has a 2-factor. undo Tag: Visual edit

15 April 2020

• curprev 19:3219:32, 15 April 2020‎ OAbot talk contribs‎ m 11,010 bytes +19‎ Open access bot: doi added to citation with #oabot. undo

2 January 2020

• curprev 06:0306:03, 2 January 2020‎ InternetArchiveBot talk contribs‎ 10,991 bytes +194‎ Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0 undo

18 December 2019

• curprev 12:4012:40, 18 December 2019‎ InternetArchiveBot talk contribs‎ 10,797 bytes −122‎ Bluelinking 1 books for verifiability.) #IABot (v2.1alpha3 undo

21 September 2019

• curprev 17:4517:45, 21 September 2019‎ Monkbot talk contribs‎ m 10,919 bytes −13‎ →‎References: Task 16: replaced (1×) / removed (0×) deprecated |dead-url= and |deadurl= with |url-status=; undo Tag: AWB

17 June 2019

• curprev 06:3806:38, 17 June 2019‎ David Eppstein talk contribs‎ 10,932 bytes +33‎ Amanda Chetwynd undo

1 April 2019

• curprev 15:2615:26, 1 April 2019‎ 161.23.112.43 talk‎ 10,899 bytes −13‎ Reverted false statement changed by Hjthoma (talk). Please note that 1-factorable implies can be partitioned into (spanning) 1-factors, so the path of length 3 is not 1-factorable. undo Tag: Undo

26 October 2018

• curprev 07:4507:45, 26 October 2018‎ Hjthoma talk contribs‎ 10,912 bytes +13‎ Changed false statement. Not all 1-factorable graphs are regular, for example, P3, the path of length 3. undo Tag: Visual edit

18 May 2018

• curprev 13:2013:20, 18 May 2018‎ Tea2min talk contribs‎ 10,899 bytes −15‎ Reverted good faith edits by Bear-rings (talk): I think these changes are disimprovements. (TW) undo Tag: Undo
• curprev 13:0513:05, 18 May 2018‎ Bear-rings talk contribs‎ 10,914 bytes +16‎ Matching (graph theory) undo
• curprev 13:0113:01, 18 May 2018‎ Bear-rings talk contribs‎ 10,898 bytes −1‎ →‎2-factorization: Hamiltonian path undo

8 December 2017

• curprev 02:2402:24, 8 December 2017‎ David Eppstein talk contribs‎ 10,899 bytes +368‎ →‎2-factorization: Oberwolfach problem undo

22 October 2017

• curprev 17:0317:03, 22 October 2017‎ InternetArchiveBot talk contribs‎ 10,531 bytes +247‎ Rescuing 1 sources and tagging 0 as dead. #IABot (v1.6beta2) undo

1 August 2017

• curprev 05:3005:30, 1 August 2017‎ David Eppstein talk contribs‎ 10,284 bytes +8‎ Category:Graph theory objects undo

16 April 2017

• curprev 00:4500:45, 16 April 2017‎ Apoorvkh talk contribs‎ 10,276 bytes +30‎ →‎Complete graphs undo

19 February 2017

• curprev 22:1722:17, 19 February 2017‎ 2620:105:b002:b100:ec95:93ab:8a2d:b222 talk‎ 10,246 bytes +28‎ This makes it more clear that the statement is not "If a graph has a 1-factor, then it is a regular." (which would be false) undo Tag: Visual edit

7 November 2016

• curprev 13:4213:42, 7 November 2016‎ 141.250.40.232 talk‎ 10,218 bytes +3‎ →‎1-factorization undo
• curprev 11:5511:55, 7 November 2016‎ 141.250.40.232 talk‎ 10,215 bytes −3‎ →‎1-factorization undo

10 September 2015

• curprev 16:0816:08, 10 September 2015‎ David Eppstein talk contribs‎ 10,218 bytes +48‎ Undid revision 680372416 by DerPhimor (talk) you're confusing "has a 1-factor" (=perfect matching) with "has a 1-factorization" (=partition into perfect matchings) undo
• curprev 13:2713:27, 10 September 2015‎ DerPhimor talk contribs‎ 10,170 bytes −48‎ →‎1-factorization: I removed the statement that 1-factorability implies regularity of a graph. undo Tag: Visual edit

5 May 2015

• curprev 21:2921:29, 5 May 2015‎ Trappist the monk talk contribs‎ 10,218 bytes −21‎ →‎Perfect 1-factorization: Remove unnecessary |display-author= parameters from CS1 templates; using AWB undo

18 April 2015

• curprev 07:1207:12, 18 April 2015‎ Hftf talk contribs‎ 10,239 bytes +2,189‎ New section on perfect 1-factorizations undo

6 February 2015

• curprev 20:5620:56, 6 February 2015‎ 128.46.119.2 talk‎ 8,050 bytes +227‎ →‎Complete graphs: +count, oeis undo

23 April 2014

• curprev 20:2720:27, 23 April 2014‎ David Eppstein talk contribs‎ 7,823 bytes −545‎ clean up undo

29 January 2014

• curprev 20:5820:58, 29 January 2014‎ Policron talk contribs‎ m 8,368 bytes +52‎ Added a reference (EOM). undo

28 January 2014

• curprev 16:2516:25, 28 January 2014‎ 194.254.113.80 talk‎ 8,316 bytes +32‎ →‎2-factorization undo

29 April 2013

• curprev 01:4101:41, 29 April 2013‎ David Eppstein talk contribs‎ m 8,284 bytes +34‎ →‎Further reading: authorlink Michael D. Plummer undo
• curprev 01:2701:27, 29 April 2013‎ David Eppstein talk contribs‎ m 8,250 bytes −76‎ Reverted edits by Graphtheorystudent5 (talk) to last version by David Eppstein undo

28 April 2013

• curprev 20:1620:16, 28 April 2013‎ Graphtheorystudent5 talk contribs‎ 8,326 bytes +53‎ →‎Further reading undo

27 April 2013

• curprev 23:2023:20, 27 April 2013‎ Graphtheorystudent5 talk contribs‎ 8,273 bytes 0‎ →‎Further reading undo
• curprev 23:2023:20, 27 April 2013‎ Graphtheorystudent5 talk contribs‎ 8,273 bytes +23‎ →‎Further reading undo

7 October 2012

• curprev 19:4919:49, 7 October 2012‎ David Eppstein talk contribs‎ m 8,250 bytes +42‎ →‎References: link Bruce Reed (mathematician) undo

16 July 2012

• curprev 06:4806:48, 16 July 2012‎ Zaslav talk contribs‎ 8,208 bytes +160‎ →‎2-factorization: Correct minor error, add counterexamples. undo
• curprev 06:4006:40, 16 July 2012‎ Zaslav talk contribs‎ m 8,048 bytes +4‎ →‎1-factorization: Copyedit. undo

24 March 2012

• curprev 14:4614:46, 24 March 2012‎ 82.131.229.194 talk‎ 8,044 bytes −7‎ →‎References undo

10 October 2011

• curprev 06:1906:19, 10 October 2011‎ David Eppstein talk contribs‎ 8,051 bytes +143‎ →‎Complete graphs: Baranyai's theorem undo

3 August 2011

• curprev 06:5106:51, 3 August 2011‎ David Eppstein talk contribs‎ 7,908 bytes −68‎ Somewhat prettier image that avoids the need for gratuitous parenthetical explanations undo