Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Fáry's_theorem> ?p ?o. }
Showing items 1 to 19 of
19
with 100 items per page.
- Fáry's_theorem abstract "In mathematics, Fary's theorem states that any simple planar graph can be drawn without crossings so that its edges are straight line segments. That is, the ability to draw graph edges as curves instead of as straight line segments does not allow a larger class of graphs to be drawn. The theorem is named after István Fáry, although it was proved independently by Klaus Wagner (1936), Fáry (1948), and S. K. Stein (1951).".
- Fáry's_theorem thumbnail Fary-induction.svg?width=300.
- Fáry's_theorem wikiPageID "6805386".
- Fáry's_theorem wikiPageRevisionID "579524218".
- Fáry's_theorem authorlink "Klaus Wagner".
- Fáry's_theorem first "Klaus".
- Fáry's_theorem last "Wagner".
- Fáry's_theorem year "1936".
- Fáry's_theorem subject Category:Articles_containing_proofs.
- Fáry's_theorem subject Category:Planar_graphs.
- Fáry's_theorem subject Category:Theorems_in_graph_theory.
- Fáry's_theorem comment "In mathematics, Fary's theorem states that any simple planar graph can be drawn without crossings so that its edges are straight line segments. That is, the ability to draw graph edges as curves instead of as straight line segments does not allow a larger class of graphs to be drawn. The theorem is named after István Fáry, although it was proved independently by Klaus Wagner (1936), Fáry (1948), and S. K. Stein (1951).".
- Fáry's_theorem label "Fáry's theorem".
- Fáry's_theorem label "Теорема Фари".
- Fáry's_theorem sameAs F%C3%A1ry's_theorem.
- Fáry's_theorem sameAs Q4455031.
- Fáry's_theorem sameAs Q4455031.
- Fáry's_theorem wasDerivedFrom Fáry's_theorem?oldid=579524218.
- Fáry's_theorem depiction Fary-induction.svg.
