Planar Projections of Graphs

Aravind, N. R. and Maniyar, Udit (2020) Planar Projections of Graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12016. pp. 453-462. ISSN 0302-9743

Full text not available from this repository. (Request a copy)


We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on n vertices has a representation in \sqrt{n/2}+1 \rceil planes. In 3 dimensions, we show that there exist graphs with edges that can be projected onto two orthogonal planes, and that this is best possible. Finally, we obtain bounds in terms of parameters such as geometric thickness and linear arboricity. Using such a bound, we show that every graph of maximum degree 5 has a plane-projectable representation in 3 dimensions.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Aravind, N R
Item Type: Article
Uncontrolled Keywords: Complete graphs; Graph drawing; Graph representation; Orthogonal plane; Parallel planes; Planar projection; Planarity; Thickness
Subjects: Computer science
Divisions: Department of Computer Science & Engineering
Depositing User: . LibTrainee 2021
Date Deposited: 30 Jul 2021 04:21
Last Modified: 07 Mar 2022 06:14
Publisher URL:
OA policy:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 8570 Statistics for this ePrint Item