Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q837902> ?p ?o }
Showing triples 1 to 39 of
39
with 100 triples per page.
- Q837902 subject Q7007191.
- Q837902 subject Q7494515.
- Q837902 abstract "In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski. It states that a finite graph is planar if and only if it does not contain a subgraph that is a subdivision of K5 (the complete graph on five vertices) or of K3,3 (complete bipartite graph on six vertices, three of which connect to each of the other three, also known as the utility graph).".
- Q837902 thumbnail GP92-Kuratowski.svg?width=300.
- Q837902 wikiPageWikiLink Q1304193.
- Q837902 wikiPageWikiLink Q131476.
- Q837902 wikiPageWikiLink Q1374495.
- Q837902 wikiPageWikiLink Q1415372.
- Q837902 wikiPageWikiLink Q15180.
- Q837902 wikiPageWikiLink Q161846.
- Q837902 wikiPageWikiLink Q161973.
- Q837902 wikiPageWikiLink Q166154.
- Q837902 wikiPageWikiLink Q166507.
- Q837902 wikiPageWikiLink Q222032.
- Q837902 wikiPageWikiLink Q2393193.
- Q837902 wikiPageWikiLink Q303100.
- Q837902 wikiPageWikiLink Q32918.
- Q837902 wikiPageWikiLink Q4455031.
- Q837902 wikiPageWikiLink Q451319.
- Q837902 wikiPageWikiLink Q45715.
- Q837902 wikiPageWikiLink Q498566.
- Q837902 wikiPageWikiLink Q5467387.
- Q837902 wikiPageWikiLink Q547823.
- Q837902 wikiPageWikiLink Q584521.
- Q837902 wikiPageWikiLink Q6404986.
- Q837902 wikiPageWikiLink Q7007191.
- Q837902 wikiPageWikiLink Q7104083.
- Q837902 wikiPageWikiLink Q7200967.
- Q837902 wikiPageWikiLink Q739462.
- Q837902 wikiPageWikiLink Q7494515.
- Q837902 wikiPageWikiLink Q7959587.
- Q837902 wikiPageWikiLink Q852973.
- Q837902 wikiPageWikiLink Q905837.
- Q837902 wikiPageWikiLink Q913598.
- Q837902 wikiPageWikiLink Q9299950.
- Q837902 wikiPageWikiLink Q93690.
- Q837902 comment "In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski. It states that a finite graph is planar if and only if it does not contain a subgraph that is a subdivision of K5 (the complete graph on five vertices) or of K3,3 (complete bipartite graph on six vertices, three of which connect to each of the other three, also known as the utility graph).".
- Q837902 label "Kuratowski's theorem".
- Q837902 depiction GP92-Kuratowski.svg.