Authors: Nadejda Sur, Sergiu Cataranciuc
Abstract
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.
N. Sur, S. Cataranciuc
Faculty of Mathematics and Informatics,
Moldova State University,
A. Mateevici street, 60, MD-2009.
E-mail : ,
Fulltext
–
0.19 Mb