Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

COMBINATORICA
2007

favoriteEmaildiscussreport

56views more COMBINATORICA 2007»

On embeddability and stresses of graphs

13 years 5 months ago

On embeddability and stresses of graphs

Download www.math.cornell.edu

Gluck [6] has proven that triangulated 2-spheres are generically 3-rigid. Equivalently, planar graphs are generically 3-stress free. We show that already the K5-minor freeness guarantees the stress freeness. More generally, we prove that every Kr+2-minor free graph is generically r-stress free for 1 ≤ r ≤ 4. (This assertion is false for r ≥ 6.) Some further extensions are discussed.

Eran Nevo

Real-time Traffic

COMBINATORICA 2007 | K5-minor Freeness | Kr+2-minor Free Graph | Stress Freeness |

claim paper

Related Content

» Random graphs on surfaces

» Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface

» ManhattanGeodesic Embedding of Planar Graphs

» UpEmbeddability of a Graph by Order and Girth

» Graphs with Large Girth Not Embeddable in the Sphere

» Planar embeddability of the vertices of a graph using a fixed point set is NPhard

» Algorithms for Graphs Embeddable with Few Crossings Per Edge

» Planar Crossing Numbers of Graphs Embeddable in Another Surface

» Mutually embeddable graphs and the tree alternative conjecture

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	COMBINATORICA
Authors	Eran Nevo

Comments (0)