Involving d-Convex Simple and Quasi-simple Planar Graphs in R~3

摘要

The problem of finding dimension of d-convex simple and quasi-simple planar graphs is studied. Algorithms for involving these graphs in R~3 are described.