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

Nadejda Sur; Sergiu Cataranciuc

Computer Science Journal of Moldova (Oct 2005)

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

Nadejda Sur,
Sergiu Cataranciuc

Affiliations

Nadejda Sur: Faculty of Mathematics and Informatics, Moldova State University, A. Mateevici street, 60, MD-2009
Sergiu Cataranciuc: Faculty of Mathematics and Informatics, Moldova State University, A. Mateevici street, 60, MD-2009

Journal volume & issue: Vol. 13, no. 2(38)
pp. 151 – 167

Abstract

Read online

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.

Published in Computer Science Journal of Moldova

ISSN: 1561-4042 (Print); 2587-4330 (Online)
Publisher: Vladimir Andrunachievici Institute of Mathematics and Computer Science
Country of publisher: Moldova, Republic of
LCC subjects: Science: Mathematics: Instruments and machines: Electronic computers. Computer science
Website: http://www.math.md/en/publications/csjm/

About the journal