Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17020604> ?p ?o }
Showing triples 1 to 24 of
24
with 100 triples per page.
- Q17020604 subject Q7007191.
- Q17020604 abstract "In topological graph theory, the Hanani–Tutte theorem is a result on the parity of edge crossings in a graph drawing. It states that every drawing in the plane of a non-planar graph contains a pair of independent edges (not both sharing an endpoint) that cross each other an odd number of times. Equivalently, it can be phrased as a planarity criterion: a graph is planar if and only if it has a drawing in which every pair of independent edges crosses evenly (or not at all).".
- Q17020604 wikiPageWikiLink Q11203.
- Q17020604 wikiPageWikiLink Q1296937.
- Q17020604 wikiPageWikiLink Q1391861.
- Q17020604 wikiPageWikiLink Q1475760.
- Q17020604 wikiPageWikiLink Q17090789.
- Q17020604 wikiPageWikiLink Q18206054.
- Q17020604 wikiPageWikiLink Q212803.
- Q17020604 wikiPageWikiLink Q230967.
- Q17020604 wikiPageWikiLink Q2393193.
- Q17020604 wikiPageWikiLink Q266775.
- Q17020604 wikiPageWikiLink Q4115842.
- Q17020604 wikiPageWikiLink Q4795236.
- Q17020604 wikiPageWikiLink Q547823.
- Q17020604 wikiPageWikiLink Q5513324.
- Q17020604 wikiPageWikiLink Q5639296.
- Q17020604 wikiPageWikiLink Q7007191.
- Q17020604 wikiPageWikiLink Q739462.
- Q17020604 wikiPageWikiLink Q8366.
- Q17020604 wikiPageWikiLink Q837902.
- Q17020604 wikiPageWikiLink Q926125.
- Q17020604 comment "In topological graph theory, the Hanani–Tutte theorem is a result on the parity of edge crossings in a graph drawing. It states that every drawing in the plane of a non-planar graph contains a pair of independent edges (not both sharing an endpoint) that cross each other an odd number of times. Equivalently, it can be phrased as a planarity criterion: a graph is planar if and only if it has a drawing in which every pair of independent edges crosses evenly (or not at all).".
- Q17020604 label "Hanani–Tutte theorem".