Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Petersen's_theorem> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Petersen's_theorem abstract "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.".
- Petersen's_theorem wikiPageID "38481437".
- Petersen's_theorem wikiPageRevisionID "595638500".
- Petersen's_theorem hasPhotoCollection Petersen's_theorem.
- Petersen's_theorem subject Category:Matching.
- Petersen's_theorem subject Category:Theorems_in_graph_theory.
- Petersen's_theorem comment "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.".
- Petersen's_theorem label "Petersen's theorem".
- Petersen's_theorem label "Satz von Petersen".
- Petersen's_theorem sameAs Satz_von_Petersen.
- Petersen's_theorem sameAs m.0r3sml7.
- Petersen's_theorem sameAs Q7178199.
- Petersen's_theorem sameAs Q7178199.
- Petersen's_theorem wasDerivedFrom Petersen's_theorem?oldid=595638500.
- Petersen's_theorem isPrimaryTopicOf Petersen's_theorem.