Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,495,323 papers from all fields of science
Search
Sign In
Create Free Account
Fáry's theorem
Known as:
Fary theorem
, Fary's Theorem
, Fáry theorem
In mathematics, Fáry's theorem states that any simple planar graph can be drawn without crossings so that its edges are straight line segments. That…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
27 relations
1-planar graph
Arboricity
Art gallery problem
Bend minimization
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Straight Line Movement in Morphing and Pursuit Evasion
Hamideh Vosoughpour Yazdchi
2017
Corpus ID: 134387517
Piece-wise linear structures are widely used to define problems and to represent simplified solutions in computational geometry…
Expand
2015
2015
Simultaneous straight-line drawing of a planar graph and its rectangular dual
T. Mchedlidze
arXiv.org
2015
Corpus ID: 14093560
A natural way to represent on the plane both a planar graph and its dual is to follow the definition of the dual, thus, to place…
Expand
2012
2012
Nonconvex Representations of Plane Graphs
G. Battista
,
Fabrizio Frati
,
M. Patrignani
SIAM Journal on Discrete Mathematics
2012
Corpus ID: 40733906
We show that every plane graph admits a planar straight-line drawing in which all faces with more than three vertices are…
Expand
2011
2011
On Sets of Lines Not-Supporting Trees
R. Fulek
,
Daniel Neuwirth
arXiv.org
2011
Corpus ID: 7704549
We study the following problem introduced by Dujmovic et al. Given a tree $T = (V,E)$, on $n$ vertices, a set of $n$ lines…
Expand
2010
2010
A note on isosceles planar graph drawing
Fabrizio Frati
Information Processing Letters
2010
Corpus ID: 9237810
2008
2008
Upward Drawings of Trees on the Minimum Number of Layers
M. J. Alam
,
Md. Abul Hassan Samee
,
Mashfiqui Rabbi
,
M. S. Rahman
Workshop on Algorithms and Computation
2008
Corpus ID: 38476179
In a planar straight-line drawing of a tree T on k layers, each vertex is placed on one of k horizontal lines called layers and…
Expand
2004
2004
OSCILLATION AND BOUNDARY CURVATURE OF HOLOMORPHIC CURVES IN C
S. Yakovenko
2004
Corpus ID: 55613710
The number of isolated intersections between a smooth curve in Euclidean space and an arbitrary hyperplane can be majorized by a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE