Petersen's theorem
In the mathematical discipline of graph theory, Petersen's theorem, named after Julius Petersen, is one of the earliest results in graph theory and can be stated as follows: Petersen's Theorem. Every cubic, bridgeless graph contains a perfect matching. In other words, if a graph has exactly three edges at each vertex, and every edge belongs to a cycle, then it has a set of edges that touches every vertex exactly once.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Petersen's theorem
In the mathematical discipline of graph theory, Petersen's theorem, named after Julius Petersen, is one of the earliest results in graph theory and can be stated as follows: Petersen's Theorem. Every cubic, bridgeless graph contains a perfect matching. In other words, if a graph has exactly three edges at each vertex, and every edge belongs to a cycle, then it has a set of edges that touches every vertex exactly once.
has abstract
Der Satz von Petersen ist ein ...... tiker Julius Petersen benannt.
@de
In the mathematical discipline ...... hes every vertex exactly once.
@en
У математичній дисципліні теор ...... кожної вершини рівно один раз.
@uk
数学におけるピーターセンの定理(ピーターセンのていり、英: ...... の端点を集めたものがグラフの頂点全体と一致するようにできる。
@ja
Wikipage page ID
38,481,437
page length (characters) of wiki page
Wikipage revision ID
1,014,952,537
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
Der Satz von Petersen ist ein ...... tiker Julius Petersen benannt.
@de
In the mathematical discipline ...... hes every vertex exactly once.
@en
У математичній дисципліні теор ...... кожної вершини рівно один раз.
@uk
数学におけるピーターセンの定理(ピーターセンのていり、英: ...... の端点を集めたものがグラフの頂点全体と一致するようにできる。
@ja
label
Petersen's theorem
@en
Satz von Petersen
@de
Теорема Петерсона
@uk
ピーターセンの定理
@ja