Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7178199> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Q7178199 subject Q7012142.
- Q7178199 subject Q7494515.
- Q7178199 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.".
- Q7178199 thumbnail Petersen-graph-factors.svg?width=300.
- Q7178199 wikiPageWikiLink Q1065144.
- Q7178199 wikiPageWikiLink Q131476.
- Q7178199 wikiPageWikiLink Q1374495.
- Q7178199 wikiPageWikiLink Q1415372.
- Q7178199 wikiPageWikiLink Q14492078.
- Q7178199 wikiPageWikiLink Q1653118.
- Q7178199 wikiPageWikiLink Q174733.
- Q7178199 wikiPageWikiLink Q175263.
- Q7178199 wikiPageWikiLink Q176640.
- Q7178199 wikiPageWikiLink Q2294516.
- Q7178199 wikiPageWikiLink Q2532492.
- Q7178199 wikiPageWikiLink Q273037.
- Q7178199 wikiPageWikiLink Q2985068.
- Q7178199 wikiPageWikiLink Q3034655.
- Q7178199 wikiPageWikiLink Q343171.
- Q7178199 wikiPageWikiLink Q3456889.
- Q7178199 wikiPageWikiLink Q357918.
- Q7178199 wikiPageWikiLink Q395.
- Q7178199 wikiPageWikiLink Q455001.
- Q7178199 wikiPageWikiLink Q4686387.
- Q7178199 wikiPageWikiLink Q510197.
- Q7178199 wikiPageWikiLink Q5282038.
- Q7178199 wikiPageWikiLink Q547823.
- Q7178199 wikiPageWikiLink Q5597083.
- Q7178199 wikiPageWikiLink Q564426.
- Q7178199 wikiPageWikiLink Q6015623.
- Q7178199 wikiPageWikiLink Q7012142.
- Q7178199 wikiPageWikiLink Q7102401.
- Q7178199 wikiPageWikiLink Q7494515.
- Q7178199 wikiPageWikiLink Q7661893.
- Q7178199 wikiPageWikiLink Q954454.
- Q7178199 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.".
- Q7178199 label "Petersen's theorem".
- Q7178199 depiction Petersen-graph-factors.svg.