The 2-factor theorem is a result in graph theory, discovered by Julius Petersen and counted among the earliest works in the field. It states that if a graph is regular with an even degree 2k, then its edges can be partitioned into k edge-disjoint 2-factors, where a 2-factor is a spanning subgraph in which every vertex has degree two and which therefore decomposes into cycles that together touch every vertex exactly once. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
StatementEvery regular graph whose degree is an even number 2k has its edges partitioned into k edge-disjoint 2-factors, where a 2-factor is a spanning subgraph in which every vertex has degree two. 1 Connections
In Branch
Source 2-factor theorem (Wikipedia)
Proved By
Source 2-factor theorem (Wikipedia)
Sources
1. 2-factor theorem (Wikipedia)
History section, first sentence
The theorem appears first in the 1891 article "Die Theorie der regulären graphs".
In Group: Graph Theory, Article text
In the mathematical discipline of graph theory, the 2-factor theorem, discovered by Julius Petersen, is one of the earliest works in graph theory.
In Branch: Graph Theory, Article text
In the mathematical discipline of graph theory, the 2-factor theorem, discovered by Julius Petersen, is one of the earliest works in graph theory.
Proved By: Julius Petersen, Lead
In the mathematical discipline of graph theory, the 2-factor theorem, discovered by Julius Petersen, is one of the earliest works in graph theory.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.