2-factor theorem: 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 09:1309:13, 23 January 2025 Citation bot talk contribs 3,653 bytes +17 Alter: title, pages. Added issue. Formatted dashes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Theorems in graph theory | #UCB_Category 5/54 undo

curprev 18:5018:50, 8 November 2023 OAbot talk contribs m 3,311 bytes +42 Open access bot: doi updated in citation with #oabot. undo

curprev 08:4508:45, 1 November 2020 Lucca Mito talk contribs m 2,789 bytes +5 No edit summary undo Tags: Visual edit Mobile edit Mobile web edit

curprev 04:5704:57, 14 January 2019 David Eppstein talk contribs 2,784 bytes −501 →Proof: WP:NOTED; ce; the Euler circuit is not the crux of the argument, so remove editorialization that says it is undo
curprev 04:5104:51, 14 January 2019 David Eppstein talk contribs 3,285 bytes +222 →top: edge-disjoint fits the terminology of our other articles better than line-disjoint, fix the comma splice, gloss 2-factor and avoid unnecessary notation-heaviness undo

curprev 06:1406:14, 13 July 2015 188.123.241.35 talk 3,033 bytes −1 →History: Fixed typo undo Tags: Mobile edit Mobile web edit

curprev 23:4823:48, 6 November 2014 121.54.83.67 talk 3,060 bytes 0 The theorem was discovered undo

curprev 04:3104:31, 29 June 2014 Ollieinc talk contribs m 3,060 bytes −2 clean up, typo(s) fixed: an eulerian → a eulerian using AWB undo

curprev 13:3913:39, 29 April 2014 Resident0593 talk contribs 2,772 bytes +2,772 ←Created page with ' In the mathematical discipline of graph theory, '''2-factor theorem''' discovered by Julius Petersen, is one of the earliest works in graph theo...'