Linear embeddings of simple graphs in $\mathbb R^3$

Our problem is to classify for any simple graph all linear embeddings of the graph in $\mathbb R^3$ up to rigid isotopy. We solve the problem for graphs with at most five vertices. For graphs with more than five vertices, we give lower and upper bounds for the number of rigid isotopy classes of linear embeddings in $\mathbb R^3$. Bibl. – 3 titles.