RO  EN
IMCS/Publications/CSJM/Issues/CSJM v.13, n.2 (38), 2005/

Involving d-Convex Simple and Quasi-simple Planar Graphs in R3

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 R3 are described.

N. Sur, S. Cataranciuc
Faculty of Mathematics and Informatics,
Moldova State University,
A. Mateevici street, 60, MD-2009.
E-mail : ,



Fulltext

Adobe PDF document0.19 Mb