Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Hanani–Tutte_theorem> ?p ?o }
Showing triples 1 to 36 of
36
with 100 triples per page.
- Hanani–Tutte_theorem 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).".
- Hanani–Tutte_theorem wikiPageID "42787595".
- Hanani–Tutte_theorem wikiPageLength "7661".
- Hanani–Tutte_theorem wikiPageOutDegree "20".
- Hanani–Tutte_theorem wikiPageRevisionID "691731192".
- Hanani–Tutte_theorem wikiPageWikiLink Algebraic_topology.
- Hanani–Tutte_theorem wikiPageWikiLink Algorithm.
- Hanani–Tutte_theorem wikiPageWikiLink Arnold_S._Shapiro.
- Hanani–Tutte_theorem wikiPageWikiLink Category:Planar_graphs.
- Hanani–Tutte_theorem wikiPageWikiLink Clustered_planarity.
- Hanani–Tutte_theorem wikiPageWikiLink Crossing_number_(graph_theory).
- Hanani–Tutte_theorem wikiPageWikiLink Egbert_van_Kampen.
- Hanani–Tutte_theorem wikiPageWikiLink GF(2).
- Hanani–Tutte_theorem wikiPageWikiLink Graph_drawing.
- Hanani–Tutte_theorem wikiPageWikiLink Haim_Hanani.
- Hanani–Tutte_theorem wikiPageWikiLink Kuratowskis_theorem.
- Hanani–Tutte_theorem wikiPageWikiLink Parity_(mathematics).
- Hanani–Tutte_theorem wikiPageWikiLink Planar_graph.
- Hanani–Tutte_theorem wikiPageWikiLink Projective_plane.
- Hanani–Tutte_theorem wikiPageWikiLink System_of_linear_equations.
- Hanani–Tutte_theorem wikiPageWikiLink Time_complexity.
- Hanani–Tutte_theorem wikiPageWikiLink Topological_graph_theory.
- Hanani–Tutte_theorem wikiPageWikiLink Upward_planar_drawing.
- Hanani–Tutte_theorem wikiPageWikiLink W._T._Tutte.
- Hanani–Tutte_theorem wikiPageWikiLink Wu_Wenjun.
- Hanani–Tutte_theorem wikiPageWikiLinkText "Hanani–Tutte theorem".
- Hanani–Tutte_theorem wikiPageUsesTemplate Template:Reflist.
- Hanani–Tutte_theorem subject Category:Planar_graphs.
- Hanani–Tutte_theorem hypernym Result.
- Hanani–Tutte_theorem 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).".
- Hanani–Tutte_theorem label "Hanani–Tutte theorem".
- Hanani–Tutte_theorem sameAs Q17020604.
- Hanani–Tutte_theorem sameAs m.010pnz08.
- Hanani–Tutte_theorem sameAs Q17020604.
- Hanani–Tutte_theorem wasDerivedFrom Hanani–Tutte_theorem?oldid=691731192.
- Hanani–Tutte_theorem isPrimaryTopicOf Hanani–Tutte_theorem.