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

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

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.

Bibliographic Details
Main Authors: Nadejda Sur, Sergiu Cataranciuc
Format: Article
Language:English
Published: Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova 2005-10-01
Series:Computer Science Journal of Moldova
Online Access:http://www.math.md/files/csjm/v13-n2/v13-n2-(pp151-167).pdf

Similar Items

Similar Items